Procedural iterpretation for an extended ATMS:
Abstract: "This paper concerns deductive procedures for abductive reasoning and a variety of ATMSs. Athough de Kleer's basic ATMS [4] has been widely used in AI, the algorithm has not yet been given any formal procedural semantics. Reiter & de Kleer [26] view an ATMS as a kind of abduc...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1990
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
547 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper concerns deductive procedures for abductive reasoning and a variety of ATMSs. Athough de Kleer's basic ATMS [4] has been widely used in AI, the algorithm has not yet been given any formal procedural semantics. Reiter & de Kleer [26] view an ATMS as a kind of abduction in which the best explanation of a formula is defined as a minimal conjunction of hypotheses that explain the formula. However, they do not give any algorithm to compute such minimal explanations of a formula in their CMS that is a generalization of the basic ATMS In this paper, we use the notion of characteristic clauses [29] to explain clearly the computational aspects of the CMS and the ATMS and to produce an efficient abductive procedure based on linear resolution. By means of this abductive procedure, we give the CMS algorithms for computing minimal explanations in the interpreted approach and for updating them in the compiled approach. We then present algorithms for generating and updating them in the compiled approach. We then present algorithms for generating and updating labels of nodes in an extended ATMS that accepts any formula justifications and literal assumptions Additionally, proof procedures for a class of nonmonotonic reasoning based on variations of the abductive procedure are also mentioned. |
| Beschreibung: | 25 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010949150 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960913s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)25298117 | ||
| 035 | |a (DE-599)BVBBV010949150 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Inoue, Katsumi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Procedural iterpretation for an extended ATMS |c by K. Inoue |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 300 | |a 25 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 547 | |
| 520 | 3 | |a Abstract: "This paper concerns deductive procedures for abductive reasoning and a variety of ATMSs. Athough de Kleer's basic ATMS [4] has been widely used in AI, the algorithm has not yet been given any formal procedural semantics. Reiter & de Kleer [26] view an ATMS as a kind of abduction in which the best explanation of a formula is defined as a minimal conjunction of hypotheses that explain the formula. However, they do not give any algorithm to compute such minimal explanations of a formula in their CMS that is a generalization of the basic ATMS | |
| 520 | 3 | |a In this paper, we use the notion of characteristic clauses [29] to explain clearly the computational aspects of the CMS and the ATMS and to produce an efficient abductive procedure based on linear resolution. By means of this abductive procedure, we give the CMS algorithms for computing minimal explanations in the interpreted approach and for updating them in the compiled approach. We then present algorithms for generating and updating them in the compiled approach. We then present algorithms for generating and updating labels of nodes in an extended ATMS that accepts any formula justifications and literal assumptions | |
| 520 | 3 | |a Additionally, proof procedures for a class of nonmonotonic reasoning based on variations of the abductive procedure are also mentioned. | |
| 650 | 4 | |a Künstliche Intelligenz | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Reasoning | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 547 |w (DE-604)BV010923438 |9 547 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007323086 | ||
Datensatz im Suchindex
| _version_ | 1804125436081340416 |
|---|---|
| any_adam_object | |
| author | Inoue, Katsumi |
| author_facet | Inoue, Katsumi |
| author_role | aut |
| author_sort | Inoue, Katsumi |
| author_variant | k i ki |
| building | Verbundindex |
| bvnumber | BV010949150 |
| ctrlnum | (OCoLC)25298117 (DE-599)BVBBV010949150 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02359nam a2200349 cb4500</leader><controlfield tag="001">BV010949150</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960913s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25298117</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010949150</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Inoue, Katsumi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Procedural iterpretation for an extended ATMS</subfield><subfield code="c">by K. Inoue</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">25 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">547</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper concerns deductive procedures for abductive reasoning and a variety of ATMSs. Athough de Kleer's basic ATMS [4] has been widely used in AI, the algorithm has not yet been given any formal procedural semantics. Reiter & de Kleer [26] view an ATMS as a kind of abduction in which the best explanation of a formula is defined as a minimal conjunction of hypotheses that explain the formula. However, they do not give any algorithm to compute such minimal explanations of a formula in their CMS that is a generalization of the basic ATMS</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In this paper, we use the notion of characteristic clauses [29] to explain clearly the computational aspects of the CMS and the ATMS and to produce an efficient abductive procedure based on linear resolution. By means of this abductive procedure, we give the CMS algorithms for computing minimal explanations in the interpreted approach and for updating them in the compiled approach. We then present algorithms for generating and updating them in the compiled approach. We then present algorithms for generating and updating labels of nodes in an extended ATMS that accepts any formula justifications and literal assumptions</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Additionally, proof procedures for a class of nonmonotonic reasoning based on variations of the abductive procedure are also mentioned.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Künstliche Intelligenz</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reasoning</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">547</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">547</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007323086</subfield></datafield></record></collection> |
| id | DE-604.BV010949150 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:31Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007323086 |
| oclc_num | 25298117 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 25 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Inoue, Katsumi Verfasser aut Procedural iterpretation for an extended ATMS by K. Inoue Tokyo, Japan 1990 25 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 547 Abstract: "This paper concerns deductive procedures for abductive reasoning and a variety of ATMSs. Athough de Kleer's basic ATMS [4] has been widely used in AI, the algorithm has not yet been given any formal procedural semantics. Reiter & de Kleer [26] view an ATMS as a kind of abduction in which the best explanation of a formula is defined as a minimal conjunction of hypotheses that explain the formula. However, they do not give any algorithm to compute such minimal explanations of a formula in their CMS that is a generalization of the basic ATMS In this paper, we use the notion of characteristic clauses [29] to explain clearly the computational aspects of the CMS and the ATMS and to produce an efficient abductive procedure based on linear resolution. By means of this abductive procedure, we give the CMS algorithms for computing minimal explanations in the interpreted approach and for updating them in the compiled approach. We then present algorithms for generating and updating them in the compiled approach. We then present algorithms for generating and updating labels of nodes in an extended ATMS that accepts any formula justifications and literal assumptions Additionally, proof procedures for a class of nonmonotonic reasoning based on variations of the abductive procedure are also mentioned. Künstliche Intelligenz Algorithms Artificial intelligence Reasoning Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 547 (DE-604)BV010923438 547 |
| spellingShingle | Inoue, Katsumi Procedural iterpretation for an extended ATMS Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Künstliche Intelligenz Algorithms Artificial intelligence Reasoning |
| title | Procedural iterpretation for an extended ATMS |
| title_auth | Procedural iterpretation for an extended ATMS |
| title_exact_search | Procedural iterpretation for an extended ATMS |
| title_full | Procedural iterpretation for an extended ATMS by K. Inoue |
| title_fullStr | Procedural iterpretation for an extended ATMS by K. Inoue |
| title_full_unstemmed | Procedural iterpretation for an extended ATMS by K. Inoue |
| title_short | Procedural iterpretation for an extended ATMS |
| title_sort | procedural iterpretation for an extended atms |
| topic | Künstliche Intelligenz Algorithms Artificial intelligence Reasoning |
| topic_facet | Künstliche Intelligenz Algorithms Artificial intelligence Reasoning |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT inouekatsumi proceduraliterpretationforanextendedatms |