Query answering for circumscription:
Abstract: "We address the problem of answering queries in circumscription and related nonmontonic formalisms. The answering process we describe uses resolution-based theorem provers recently developed for circumscription. In a way analogous to query answering techniques in classical predicate l...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1991
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
611 |
| Subjects: | |
| Summary: | Abstract: "We address the problem of answering queries in circumscription and related nonmontonic formalisms. The answering process we describe uses resolution-based theorem provers recently developed for circumscription. In a way analogous to query answering techniques in classical predicate logic, the process extracts information from a proof of the query. Circumscriptive theorem provers consist of two processes, generating explanations for the theorem to be proved and showing that these explanations cannot be refuted. In general, many explanations compete in supporting the theorem We show that queries can be answered by finding certain combinations of explanations, and present results to search the space of explanations, while carrying out significant pruning on this space. The results are relevant to other nonmonotonic formalisms having explanation- based proof procedures. |
| Physical Description: | 16 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010953764 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)24995739 | ||
| 035 | |a (DE-599)BVBBV010953764 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Helft, Nicolas |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Query answering for circumscription |c by N. Helft, K. Inoue & D. Poole |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 16 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 611 | |
| 520 | 3 | |a Abstract: "We address the problem of answering queries in circumscription and related nonmontonic formalisms. The answering process we describe uses resolution-based theorem provers recently developed for circumscription. In a way analogous to query answering techniques in classical predicate logic, the process extracts information from a proof of the query. Circumscriptive theorem provers consist of two processes, generating explanations for the theorem to be proved and showing that these explanations cannot be refuted. In general, many explanations compete in supporting the theorem | |
| 520 | 3 | |a We show that queries can be answered by finding certain combinations of explanations, and present results to search the space of explanations, while carrying out significant pruning on this space. The results are relevant to other nonmonotonic formalisms having explanation- based proof procedures. | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Proof theory | |
| 700 | 1 | |a Inoue, Katsumi |e Verfasser |4 aut | |
| 700 | 1 | |a Poole, David |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 611 |w (DE-604)BV010923438 |9 611 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326221 | ||
Record in the Search Index
| _version_ | 1804125440639500288 |
|---|---|
| any_adam_object | |
| author | Helft, Nicolas Inoue, Katsumi Poole, David |
| author_facet | Helft, Nicolas Inoue, Katsumi Poole, David |
| author_role | aut aut aut |
| author_sort | Helft, Nicolas |
| author_variant | n h nh k i ki d p dp |
| building | Verbundindex |
| bvnumber | BV010953764 |
| ctrlnum | (OCoLC)24995739 (DE-599)BVBBV010953764 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01956nam a2200337 cb4500</leader><controlfield tag="001">BV010953764</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960917s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24995739</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010953764</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">Helft, Nicolas</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Query answering for circumscription</subfield><subfield code="c">by N. Helft, K. Inoue & D. Poole</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">16 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">611</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We address the problem of answering queries in circumscription and related nonmontonic formalisms. The answering process we describe uses resolution-based theorem provers recently developed for circumscription. In a way analogous to query answering techniques in classical predicate logic, the process extracts information from a proof of the query. Circumscriptive theorem provers consist of two processes, generating explanations for the theorem to be proved and showing that these explanations cannot be refuted. In general, many explanations compete in supporting the theorem</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We show that queries can be answered by finding certain combinations of explanations, and present results to search the space of explanations, while carrying out significant pruning on this space. The results are relevant to other nonmonotonic formalisms having explanation- based proof procedures.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</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="700" ind1="1" ind2=" "><subfield code="a">Poole, David</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">611</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">611</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326221</subfield></datafield></record></collection> |
| id | DE-604.BV010953764 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326221 |
| oclc_num | 24995739 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 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 | Helft, Nicolas Verfasser aut Query answering for circumscription by N. Helft, K. Inoue & D. Poole Tokyo, Japan 1991 16 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 611 Abstract: "We address the problem of answering queries in circumscription and related nonmontonic formalisms. The answering process we describe uses resolution-based theorem provers recently developed for circumscription. In a way analogous to query answering techniques in classical predicate logic, the process extracts information from a proof of the query. Circumscriptive theorem provers consist of two processes, generating explanations for the theorem to be proved and showing that these explanations cannot be refuted. In general, many explanations compete in supporting the theorem We show that queries can be answered by finding certain combinations of explanations, and present results to search the space of explanations, while carrying out significant pruning on this space. The results are relevant to other nonmonotonic formalisms having explanation- based proof procedures. Automatic theorem proving Proof theory Inoue, Katsumi Verfasser aut Poole, David Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 611 (DE-604)BV010923438 611 |
| spellingShingle | Helft, Nicolas Inoue, Katsumi Poole, David Query answering for circumscription Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Automatic theorem proving Proof theory |
| title | Query answering for circumscription |
| title_auth | Query answering for circumscription |
| title_exact_search | Query answering for circumscription |
| title_full | Query answering for circumscription by N. Helft, K. Inoue & D. Poole |
| title_fullStr | Query answering for circumscription by N. Helft, K. Inoue & D. Poole |
| title_full_unstemmed | Query answering for circumscription by N. Helft, K. Inoue & D. Poole |
| title_short | Query answering for circumscription |
| title_sort | query answering for circumscription |
| topic | Automatic theorem proving Proof theory |
| topic_facet | Automatic theorem proving Proof theory |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT helftnicolas queryansweringforcircumscription AT inouekatsumi queryansweringforcircumscription AT pooledavid queryansweringforcircumscription |