Linear resolution for consequence-finding:
Abstract: "Since linear resolution with clause ordering is not complete for consequence-finding, it has been used mainly for proof- finding. In this paper, we re-evaluate consequence-finding based on ordered-linear resolution. Firstly, consequence-finding is generalized to the problem in which...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1991
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
683 |
| Subjects: | |
| Summary: | Abstract: "Since linear resolution with clause ordering is not complete for consequence-finding, it has been used mainly for proof- finding. In this paper, we re-evaluate consequence-finding based on ordered-linear resolution. Firstly, consequence-finding is generalized to the problem in which only interesting clauses having a certain property (called characteristic clauses) should be found. Then, we show how adding a skip rule to ordered linear resolution makes it complete for consequence-finding in this general sense. The important feature of the proposed method is that it constructs such a subset of consequences directly without testing each generated clause for the required property This feature is very effective for computing abduction and nonmonotonic reasoning. |
| Physical Description: | 50 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010954544 | ||
| 003 | DE-604 | ||
| 005 | 20010627 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)26039970 | ||
| 035 | |a (DE-599)BVBBV010954544 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 500f |2 stub | ||
| 100 | 1 | |a Inoue, Katsumi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Linear resolution for consequence-finding |c by K. Inoue |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 50 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 683 | |
| 520 | 3 | |a Abstract: "Since linear resolution with clause ordering is not complete for consequence-finding, it has been used mainly for proof- finding. In this paper, we re-evaluate consequence-finding based on ordered-linear resolution. Firstly, consequence-finding is generalized to the problem in which only interesting clauses having a certain property (called characteristic clauses) should be found. Then, we show how adding a skip rule to ordered linear resolution makes it complete for consequence-finding in this general sense. The important feature of the proposed method is that it constructs such a subset of consequences directly without testing each generated clause for the required property | |
| 520 | 3 | |a This feature is very effective for computing abduction and nonmonotonic reasoning. | |
| 650 | 4 | |a Automatic theorem proving | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 683 |w (DE-604)BV010923438 |9 683 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326884 | ||
Record in the Search Index
| _version_ | 1804125441517158400 |
|---|---|
| any_adam_object | |
| author | Inoue, Katsumi |
| author_facet | Inoue, Katsumi |
| author_role | aut |
| author_sort | Inoue, Katsumi |
| author_variant | k i ki |
| building | Verbundindex |
| bvnumber | BV010954544 |
| classification_tum | DAT 500f |
| ctrlnum | (OCoLC)26039970 (DE-599)BVBBV010954544 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01740nam a2200313 cb4500</leader><controlfield tag="001">BV010954544</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20010627 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960917s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26039970</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010954544</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="084" ind1=" " ind2=" "><subfield code="a">DAT 500f</subfield><subfield code="2">stub</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">Linear resolution for consequence-finding</subfield><subfield code="c">by 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">50 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">683</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Since linear resolution with clause ordering is not complete for consequence-finding, it has been used mainly for proof- finding. In this paper, we re-evaluate consequence-finding based on ordered-linear resolution. Firstly, consequence-finding is generalized to the problem in which only interesting clauses having a certain property (called characteristic clauses) should be found. Then, we show how adding a skip rule to ordered linear resolution makes it complete for consequence-finding in this general sense. The important feature of the proposed method is that it constructs such a subset of consequences directly without testing each generated clause for the required property</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This feature is very effective for computing abduction and nonmonotonic reasoning.</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">683</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">683</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326884</subfield></datafield></record></collection> |
| id | DE-604.BV010954544 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:37Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326884 |
| oclc_num | 26039970 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 50 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 | Inoue, Katsumi Verfasser aut Linear resolution for consequence-finding by K. Inoue Tokyo, Japan 1991 50 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 683 Abstract: "Since linear resolution with clause ordering is not complete for consequence-finding, it has been used mainly for proof- finding. In this paper, we re-evaluate consequence-finding based on ordered-linear resolution. Firstly, consequence-finding is generalized to the problem in which only interesting clauses having a certain property (called characteristic clauses) should be found. Then, we show how adding a skip rule to ordered linear resolution makes it complete for consequence-finding in this general sense. The important feature of the proposed method is that it constructs such a subset of consequences directly without testing each generated clause for the required property This feature is very effective for computing abduction and nonmonotonic reasoning. Automatic theorem proving Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 683 (DE-604)BV010923438 683 |
| spellingShingle | Inoue, Katsumi Linear resolution for consequence-finding Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Automatic theorem proving |
| title | Linear resolution for consequence-finding |
| title_auth | Linear resolution for consequence-finding |
| title_exact_search | Linear resolution for consequence-finding |
| title_full | Linear resolution for consequence-finding by K. Inoue |
| title_fullStr | Linear resolution for consequence-finding by K. Inoue |
| title_full_unstemmed | Linear resolution for consequence-finding by K. Inoue |
| title_short | Linear resolution for consequence-finding |
| title_sort | linear resolution for consequence finding |
| topic | Automatic theorem proving |
| topic_facet | Automatic theorem proving |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT inouekatsumi linearresolutionforconsequencefinding |