Extracting answers in circumscription:
Abstract: "This paper gives a solution to two problems that arise in recent implementations of theorem provers for circumscription. The first problem is that, when a query contains variables, they only produce yes/no answers, rather than returning the actual values of the variables for which th...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1990
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum
855 |
| Subjects: | |
| Summary: | Abstract: "This paper gives a solution to two problems that arise in recent implementations of theorem provers for circumscription. The first problem is that, when a query contains variables, they only produce yes/no answers, rather than returning the actual values of the variables for which the query holds. The problem can be attributed to these theorem provers finding all explanations for a goal, rather than finding a minimal disjunct of these explanations. As well as providing answer extraction, we show how this technique of finding only minimal disjuncts of explanations can save much redundant computation." |
| Physical Description: | 7 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010972744 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960926s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)22697643 | ||
| 035 | |a (DE-599)BVBBV010972744 | ||
| 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 Extracting answers in circumscription |c by N. Helft, K. Inoue & D. Poole |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 300 | |a 7 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 memorandum |v 855 | |
| 520 | 3 | |a Abstract: "This paper gives a solution to two problems that arise in recent implementations of theorem provers for circumscription. The first problem is that, when a query contains variables, they only produce yes/no answers, rather than returning the actual values of the variables for which the query holds. The problem can be attributed to these theorem provers finding all explanations for a goal, rather than finding a minimal disjunct of these explanations. As well as providing answer extraction, we show how this technique of finding only minimal disjuncts of explanations can save much redundant computation." | |
| 650 | 4 | |a Automatic theorem proving | |
| 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 memorandum |v 855 |w (DE-604)BV010943497 |9 855 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007342129 | ||
Record in the Search Index
| _version_ | 1804125460936785920 |
|---|---|
| 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 | BV010972744 |
| ctrlnum | (OCoLC)22697643 (DE-599)BVBBV010972744 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01649nam a2200313 cb4500</leader><controlfield tag="001">BV010972744</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960926s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22697643</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010972744</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">Extracting answers in 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">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 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 memorandum</subfield><subfield code="v">855</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper gives a solution to two problems that arise in recent implementations of theorem provers for circumscription. The first problem is that, when a query contains variables, they only produce yes/no answers, rather than returning the actual values of the variables for which the query holds. The problem can be attributed to these theorem provers finding all explanations for a goal, rather than finding a minimal disjunct of these explanations. As well as providing answer extraction, we show how this technique of finding only minimal disjuncts of explanations can save much redundant computation."</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">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 memorandum</subfield><subfield code="v">855</subfield><subfield code="w">(DE-604)BV010943497</subfield><subfield code="9">855</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007342129</subfield></datafield></record></collection> |
| id | DE-604.BV010972744 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:55Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007342129 |
| oclc_num | 22697643 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 7 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum |
| spelling | Helft, Nicolas Verfasser aut Extracting answers in circumscription by N. Helft, K. Inoue & D. Poole Tokyo, Japan 1990 7 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum 855 Abstract: "This paper gives a solution to two problems that arise in recent implementations of theorem provers for circumscription. The first problem is that, when a query contains variables, they only produce yes/no answers, rather than returning the actual values of the variables for which the query holds. The problem can be attributed to these theorem provers finding all explanations for a goal, rather than finding a minimal disjunct of these explanations. As well as providing answer extraction, we show how this technique of finding only minimal disjuncts of explanations can save much redundant computation." Automatic theorem proving Inoue, Katsumi Verfasser aut Poole, David Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum 855 (DE-604)BV010943497 855 |
| spellingShingle | Helft, Nicolas Inoue, Katsumi Poole, David Extracting answers in circumscription Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical memorandum Automatic theorem proving |
| title | Extracting answers in circumscription |
| title_auth | Extracting answers in circumscription |
| title_exact_search | Extracting answers in circumscription |
| title_full | Extracting answers in circumscription by N. Helft, K. Inoue & D. Poole |
| title_fullStr | Extracting answers in circumscription by N. Helft, K. Inoue & D. Poole |
| title_full_unstemmed | Extracting answers in circumscription by N. Helft, K. Inoue & D. Poole |
| title_short | Extracting answers in circumscription |
| title_sort | extracting answers in circumscription |
| topic | Automatic theorem proving |
| topic_facet | Automatic theorem proving |
| volume_link | (DE-604)BV010943497 |
| work_keys_str_mv | AT helftnicolas extractinganswersincircumscription AT inouekatsumi extractinganswersincircumscription AT pooledavid extractinganswersincircumscription |