Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction:
Abstract: "Typical bottom-up, forward-chaining reasoning systems such as hyperresolution lack goal-directedness while typical top-down, backward-chaining reasoning systems like Prolog or model elimination repeatedly solve the same goals. Reasoning systems that are goal-directed and avoid repeat...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1991
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
664 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Typical bottom-up, forward-chaining reasoning systems such as hyperresolution lack goal-directedness while typical top-down, backward-chaining reasoning systems like Prolog or model elimination repeatedly solve the same goals. Reasoning systems that are goal-directed and avoid repeatedly solving the same goals can be constructed by formulating the top-down methods metatheoretically for execution by a bottom-up reasoning system (hence, 'upside-down meta-interpretation' is being used) This method also allows incorporation of more flexible search ordering strategies, such as merit-ordered search, that are commonly available in bottom-up but not top-down interpreters; this advantage is not so readily or fully achievable in the alternative approach of adding caching to a top-down interpreter. Neiman has developed a similar method for deduction with Horn clauses and Bry has explored the idea in the context of query evaluation in databases. This work extends theirs to both non-Horn clauses and abductive reasoning and can be regarded as an extension of the magic set method to these cases. Model elimination extended by the ability to make assumptions for abduction and its restriction to Horn clauses are the top-down methods adapted here. |
| Beschreibung: | 21 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010954425 | ||
| 003 | DE-604 | ||
| 005 | 20090624 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)26039987 | ||
| 035 | |a (DE-599)BVBBV010954425 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Stickel, Mark E. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction |c by Mark Stickel |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 21 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 664 | |
| 520 | 3 | |a Abstract: "Typical bottom-up, forward-chaining reasoning systems such as hyperresolution lack goal-directedness while typical top-down, backward-chaining reasoning systems like Prolog or model elimination repeatedly solve the same goals. Reasoning systems that are goal-directed and avoid repeatedly solving the same goals can be constructed by formulating the top-down methods metatheoretically for execution by a bottom-up reasoning system (hence, 'upside-down meta-interpretation' is being used) | |
| 520 | 3 | |a This method also allows incorporation of more flexible search ordering strategies, such as merit-ordered search, that are commonly available in bottom-up but not top-down interpreters; this advantage is not so readily or fully achievable in the alternative approach of adding caching to a top-down interpreter. Neiman has developed a similar method for deduction with Horn clauses and Bry has explored the idea in the context of query evaluation in databases. This work extends theirs to both non-Horn clauses and abductive reasoning and can be regarded as an extension of the magic set method to these cases. Model elimination extended by the ability to make assumptions for abduction and its restriction to Horn clauses are the top-down methods adapted here. | |
| 650 | 4 | |a Automatic theorem proving | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 664 |w (DE-604)BV010923438 |9 664 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326777 | ||
Datensatz im Suchindex
| _version_ | 1804125441351483392 |
|---|---|
| any_adam_object | |
| author | Stickel, Mark E. |
| author_facet | Stickel, Mark E. |
| author_role | aut |
| author_sort | Stickel, Mark E. |
| author_variant | m e s me mes |
| building | Verbundindex |
| bvnumber | BV010954425 |
| ctrlnum | (OCoLC)26039987 (DE-599)BVBBV010954425 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02265nam a2200301 cb4500</leader><controlfield tag="001">BV010954425</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090624 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960917s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26039987</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010954425</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">Stickel, Mark E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction</subfield><subfield code="c">by Mark Stickel</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">21 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">664</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Typical bottom-up, forward-chaining reasoning systems such as hyperresolution lack goal-directedness while typical top-down, backward-chaining reasoning systems like Prolog or model elimination repeatedly solve the same goals. Reasoning systems that are goal-directed and avoid repeatedly solving the same goals can be constructed by formulating the top-down methods metatheoretically for execution by a bottom-up reasoning system (hence, 'upside-down meta-interpretation' is being used)</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This method also allows incorporation of more flexible search ordering strategies, such as merit-ordered search, that are commonly available in bottom-up but not top-down interpreters; this advantage is not so readily or fully achievable in the alternative approach of adding caching to a top-down interpreter. Neiman has developed a similar method for deduction with Horn clauses and Bry has explored the idea in the context of query evaluation in databases. This work extends theirs to both non-Horn clauses and abductive reasoning and can be regarded as an extension of the magic set method to these cases. Model elimination extended by the ability to make assumptions for abduction and its restriction to Horn clauses are the top-down methods adapted here.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</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">664</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">664</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326777</subfield></datafield></record></collection> |
| id | DE-604.BV010954425 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326777 |
| oclc_num | 26039987 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 21 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 | Stickel, Mark E. Verfasser aut Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction by Mark Stickel Tokyo, Japan 1991 21 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 664 Abstract: "Typical bottom-up, forward-chaining reasoning systems such as hyperresolution lack goal-directedness while typical top-down, backward-chaining reasoning systems like Prolog or model elimination repeatedly solve the same goals. Reasoning systems that are goal-directed and avoid repeatedly solving the same goals can be constructed by formulating the top-down methods metatheoretically for execution by a bottom-up reasoning system (hence, 'upside-down meta-interpretation' is being used) This method also allows incorporation of more flexible search ordering strategies, such as merit-ordered search, that are commonly available in bottom-up but not top-down interpreters; this advantage is not so readily or fully achievable in the alternative approach of adding caching to a top-down interpreter. Neiman has developed a similar method for deduction with Horn clauses and Bry has explored the idea in the context of query evaluation in databases. This work extends theirs to both non-Horn clauses and abductive reasoning and can be regarded as an extension of the magic set method to these cases. Model elimination extended by the ability to make assumptions for abduction and its restriction to Horn clauses are the top-down methods adapted here. Automatic theorem proving Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 664 (DE-604)BV010923438 664 |
| spellingShingle | Stickel, Mark E. Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Automatic theorem proving |
| title | Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction |
| title_auth | Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction |
| title_exact_search | Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction |
| title_full | Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction by Mark Stickel |
| title_fullStr | Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction by Mark Stickel |
| title_full_unstemmed | Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction by Mark Stickel |
| title_short | Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction |
| title_sort | upside down meta interpretation of the model elimination theorem proving procedure for deduction and abduction |
| topic | Automatic theorem proving |
| topic_facet | Automatic theorem proving |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT stickelmarke upsidedownmetainterpretationofthemodeleliminationtheoremprovingprocedurefordeductionandabduction |