On theorem provers for circumscription:
Abstract: "This paper concerns algorithms to answer queries in circumscriptive theories. Two recent papers present such algorithms that are relatively complex: Przymusinski's algorithm is based on MILO-resolution, a variant of ordered linear resolution; Ginsberg's theorem prover uses...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1990
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
527 |
| Subjects: | |
| Summary: | Abstract: "This paper concerns algorithms to answer queries in circumscriptive theories. Two recent papers present such algorithms that are relatively complex: Przymusinski's algorithm is based on MILO-resolution, a variant of ordered linear resolution; Ginsberg's theorem prover uses a backward-chaining ATMS. Because of their different concerns, formalisms, and implementation, it is not clear what their relative advantages are. This paper makes a detailed comparison of these relating them to a logical framework of abduction, explains their intuitive meaning, and shows how the efficiency of both can be improved. Additionally, some limitations of both circumscriptive theorem provers are also discussed." |
| Physical Description: | 18 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010949532 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960916s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)22495646 | ||
| 035 | |a (DE-599)BVBBV010949532 | ||
| 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 On theorem provers for circumscription |c by K. Inoue & N. Helft |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 300 | |a 18 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 527 | |
| 520 | 3 | |a Abstract: "This paper concerns algorithms to answer queries in circumscriptive theories. Two recent papers present such algorithms that are relatively complex: Przymusinski's algorithm is based on MILO-resolution, a variant of ordered linear resolution; Ginsberg's theorem prover uses a backward-chaining ATMS. Because of their different concerns, formalisms, and implementation, it is not clear what their relative advantages are. This paper makes a detailed comparison of these relating them to a logical framework of abduction, explains their intuitive meaning, and shows how the efficiency of both can be improved. Additionally, some limitations of both circumscriptive theorem provers are also discussed." | |
| 650 | 4 | |a Automatic theorem proving | |
| 700 | 1 | |a Helft, Nicolas |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 527 |w (DE-604)BV010923438 |9 527 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007323430 | ||
Record in the Search Index
| _version_ | 1804125436535373824 |
|---|---|
| any_adam_object | |
| author | Inoue, Katsumi Helft, Nicolas |
| author_facet | Inoue, Katsumi Helft, Nicolas |
| author_role | aut aut |
| author_sort | Inoue, Katsumi |
| author_variant | k i ki n h nh |
| building | Verbundindex |
| bvnumber | BV010949532 |
| ctrlnum | (OCoLC)22495646 (DE-599)BVBBV010949532 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01680nam a2200301 cb4500</leader><controlfield tag="001">BV010949532</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960916s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22495646</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010949532</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">On theorem provers for circumscription</subfield><subfield code="c">by K. Inoue & N. Helft</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">18 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">527</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper concerns algorithms to answer queries in circumscriptive theories. Two recent papers present such algorithms that are relatively complex: Przymusinski's algorithm is based on MILO-resolution, a variant of ordered linear resolution; Ginsberg's theorem prover uses a backward-chaining ATMS. Because of their different concerns, formalisms, and implementation, it is not clear what their relative advantages are. This paper makes a detailed comparison of these relating them to a logical framework of abduction, explains their intuitive meaning, and shows how the efficiency of both can be improved. Additionally, some limitations of both circumscriptive theorem provers are also discussed."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Helft, Nicolas</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">527</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">527</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007323430</subfield></datafield></record></collection> |
| id | DE-604.BV010949532 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:32Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007323430 |
| oclc_num | 22495646 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 18 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 On theorem provers for circumscription by K. Inoue & N. Helft Tokyo, Japan 1990 18 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 527 Abstract: "This paper concerns algorithms to answer queries in circumscriptive theories. Two recent papers present such algorithms that are relatively complex: Przymusinski's algorithm is based on MILO-resolution, a variant of ordered linear resolution; Ginsberg's theorem prover uses a backward-chaining ATMS. Because of their different concerns, formalisms, and implementation, it is not clear what their relative advantages are. This paper makes a detailed comparison of these relating them to a logical framework of abduction, explains their intuitive meaning, and shows how the efficiency of both can be improved. Additionally, some limitations of both circumscriptive theorem provers are also discussed." Automatic theorem proving Helft, Nicolas Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 527 (DE-604)BV010923438 527 |
| spellingShingle | Inoue, Katsumi Helft, Nicolas On theorem provers for circumscription Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Automatic theorem proving |
| title | On theorem provers for circumscription |
| title_auth | On theorem provers for circumscription |
| title_exact_search | On theorem provers for circumscription |
| title_full | On theorem provers for circumscription by K. Inoue & N. Helft |
| title_fullStr | On theorem provers for circumscription by K. Inoue & N. Helft |
| title_full_unstemmed | On theorem provers for circumscription by K. Inoue & N. Helft |
| title_short | On theorem provers for circumscription |
| title_sort | on theorem provers for circumscription |
| topic | Automatic theorem proving |
| topic_facet | Automatic theorem proving |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT inouekatsumi ontheoremproversforcircumscription AT helftnicolas ontheoremproversforcircumscription |