A forward-chaining hypothetical reasoner based on upside-down meta-interpretation:
Abstract: "A forward-chaining hypothetical reasoner with the assumption-based truth maintenance system (ATMS) has some advantages such as avoiding repeated proofs. However, it may prove subgoals unrelated to proofs of the given goal. To simulate top-down reasoning on bottom-up reasoners, we can...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1991
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
700 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "A forward-chaining hypothetical reasoner with the assumption-based truth maintenance system (ATMS) has some advantages such as avoiding repeated proofs. However, it may prove subgoals unrelated to proofs of the given goal. To simulate top-down reasoning on bottom-up reasoners, we can apply the upside-down meta-interpretation method to hypothetical reasoning. Unfortunately, when programs include negative clauses, it does not achieve speedups because checking consistency of solutions by negative clauses should be globally evaluated. We present a new transformation algorithm of programs for efficient forward-chaining hypothetical reasoning based on the upside-down meta-interpretation This transformation algorithm analyzes dependencies among predicate symbols in programs by using an ATMS. By this pre-dependency- analysis, we are able to restrict consistency checking to those negative clauses relevant to the given goal. The transformation algorithm has been evaluated with a logic circuit design problem. |
| Beschreibung: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010955930 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960918s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)26562372 | ||
| 035 | |a (DE-599)BVBBV010955930 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Ohta, Yoshihiko |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A forward-chaining hypothetical reasoner based on upside-down meta-interpretation |c by Y. Ohta & K. Inoue |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 15 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 700 | |
| 520 | 3 | |a Abstract: "A forward-chaining hypothetical reasoner with the assumption-based truth maintenance system (ATMS) has some advantages such as avoiding repeated proofs. However, it may prove subgoals unrelated to proofs of the given goal. To simulate top-down reasoning on bottom-up reasoners, we can apply the upside-down meta-interpretation method to hypothetical reasoning. Unfortunately, when programs include negative clauses, it does not achieve speedups because checking consistency of solutions by negative clauses should be globally evaluated. We present a new transformation algorithm of programs for efficient forward-chaining hypothetical reasoning based on the upside-down meta-interpretation | |
| 520 | 3 | |a This transformation algorithm analyzes dependencies among predicate symbols in programs by using an ATMS. By this pre-dependency- analysis, we are able to restrict consistency checking to those negative clauses relevant to the given goal. The transformation algorithm has been evaluated with a logic circuit design problem. | |
| 650 | 4 | |a Expert systems (Computer science) | |
| 650 | 4 | |a Reasoning | |
| 700 | 1 | |a Inoue, Katsumi |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 700 |w (DE-604)BV010923438 |9 700 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007328126 | ||
Datensatz im Suchindex
| _version_ | 1804125443090022400 |
|---|---|
| any_adam_object | |
| author | Ohta, Yoshihiko Inoue, Katsumi |
| author_facet | Ohta, Yoshihiko Inoue, Katsumi |
| author_role | aut aut |
| author_sort | Ohta, Yoshihiko |
| author_variant | y o yo k i ki |
| building | Verbundindex |
| bvnumber | BV010955930 |
| ctrlnum | (OCoLC)26562372 (DE-599)BVBBV010955930 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02091nam a2200325 cb4500</leader><controlfield tag="001">BV010955930</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960918s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26562372</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010955930</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">Ohta, Yoshihiko</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A forward-chaining hypothetical reasoner based on upside-down meta-interpretation</subfield><subfield code="c">by Y. Ohta & K. Inoue</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 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">700</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A forward-chaining hypothetical reasoner with the assumption-based truth maintenance system (ATMS) has some advantages such as avoiding repeated proofs. However, it may prove subgoals unrelated to proofs of the given goal. To simulate top-down reasoning on bottom-up reasoners, we can apply the upside-down meta-interpretation method to hypothetical reasoning. Unfortunately, when programs include negative clauses, it does not achieve speedups because checking consistency of solutions by negative clauses should be globally evaluated. We present a new transformation algorithm of programs for efficient forward-chaining hypothetical reasoning based on the upside-down meta-interpretation</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This transformation algorithm analyzes dependencies among predicate symbols in programs by using an ATMS. By this pre-dependency- analysis, we are able to restrict consistency checking to those negative clauses relevant to the given goal. The transformation algorithm has been evaluated with a logic circuit design problem.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Expert systems (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reasoning</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Inoue, Katsumi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">700</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">700</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328126</subfield></datafield></record></collection> |
| id | DE-604.BV010955930 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:38Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328126 |
| oclc_num | 26562372 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 15 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| 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 | Ohta, Yoshihiko Verfasser aut A forward-chaining hypothetical reasoner based on upside-down meta-interpretation by Y. Ohta & K. Inoue Tokyo, Japan 1991 15 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 700 Abstract: "A forward-chaining hypothetical reasoner with the assumption-based truth maintenance system (ATMS) has some advantages such as avoiding repeated proofs. However, it may prove subgoals unrelated to proofs of the given goal. To simulate top-down reasoning on bottom-up reasoners, we can apply the upside-down meta-interpretation method to hypothetical reasoning. Unfortunately, when programs include negative clauses, it does not achieve speedups because checking consistency of solutions by negative clauses should be globally evaluated. We present a new transformation algorithm of programs for efficient forward-chaining hypothetical reasoning based on the upside-down meta-interpretation This transformation algorithm analyzes dependencies among predicate symbols in programs by using an ATMS. By this pre-dependency- analysis, we are able to restrict consistency checking to those negative clauses relevant to the given goal. The transformation algorithm has been evaluated with a logic circuit design problem. Expert systems (Computer science) Reasoning Inoue, Katsumi Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 700 (DE-604)BV010923438 700 |
| spellingShingle | Ohta, Yoshihiko Inoue, Katsumi A forward-chaining hypothetical reasoner based on upside-down meta-interpretation Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Expert systems (Computer science) Reasoning |
| title | A forward-chaining hypothetical reasoner based on upside-down meta-interpretation |
| title_auth | A forward-chaining hypothetical reasoner based on upside-down meta-interpretation |
| title_exact_search | A forward-chaining hypothetical reasoner based on upside-down meta-interpretation |
| title_full | A forward-chaining hypothetical reasoner based on upside-down meta-interpretation by Y. Ohta & K. Inoue |
| title_fullStr | A forward-chaining hypothetical reasoner based on upside-down meta-interpretation by Y. Ohta & K. Inoue |
| title_full_unstemmed | A forward-chaining hypothetical reasoner based on upside-down meta-interpretation by Y. Ohta & K. Inoue |
| title_short | A forward-chaining hypothetical reasoner based on upside-down meta-interpretation |
| title_sort | a forward chaining hypothetical reasoner based on upside down meta interpretation |
| topic | Expert systems (Computer science) Reasoning |
| topic_facet | Expert systems (Computer science) Reasoning |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT ohtayoshihiko aforwardchaininghypotheticalreasonerbasedonupsidedownmetainterpretation AT inouekatsumi aforwardchaininghypotheticalreasonerbasedonupsidedownmetainterpretation |