Embedding negation as failure into a model generation theorem prover:
Abstract: "Here, for the first time, we give an implementation which computes answer sets of every class of logic program and deductive database. The proposal is based on bottom-up, incremental, backtrack-free computation of the minimal models of positive disjunctive programs, together with int...
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
722 |
| Subjects: | |
| Summary: | Abstract: "Here, for the first time, we give an implementation which computes answer sets of every class of logic program and deductive database. The proposal is based on bottom-up, incremental, backtrack-free computation of the minimal models of positive disjunctive programs, together with integrity constraints over beliefs and disbeliefs. The procedure has been implemented on top of a model generation theorem prover (MGTP) on a distributed-memory multiprocessor machine (Multi-PSI), and is currently being applied to a legal reasoning system developed at ICOT." |
| Physical Description: | 22 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010956151 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960918s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)26726503 | ||
| 035 | |a (DE-599)BVBBV010956151 | ||
| 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 Embedding negation as failure into a model generation theorem prover |c by K. Inoue, M. Koshimura & R. Hasegawa |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 22 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 722 | |
| 520 | 3 | |a Abstract: "Here, for the first time, we give an implementation which computes answer sets of every class of logic program and deductive database. The proposal is based on bottom-up, incremental, backtrack-free computation of the minimal models of positive disjunctive programs, together with integrity constraints over beliefs and disbeliefs. The procedure has been implemented on top of a model generation theorem prover (MGTP) on a distributed-memory multiprocessor machine (Multi-PSI), and is currently being applied to a legal reasoning system developed at ICOT." | |
| 650 | 4 | |a Automatic theorem proving | |
| 700 | 1 | |a Koshimura, Miyuki |e Verfasser |4 aut | |
| 700 | 1 | |a Hasegawa, Ryuzo |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 722 |w (DE-604)BV010923438 |9 722 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007328324 | ||
Record in the Search Index
| _version_ | 1804125443332243456 |
|---|---|
| any_adam_object | |
| author | Inoue, Katsumi Koshimura, Miyuki Hasegawa, Ryuzo |
| author_facet | Inoue, Katsumi Koshimura, Miyuki Hasegawa, Ryuzo |
| author_role | aut aut aut |
| author_sort | Inoue, Katsumi |
| author_variant | k i ki m k mk r h rh |
| building | Verbundindex |
| bvnumber | BV010956151 |
| ctrlnum | (OCoLC)26726503 (DE-599)BVBBV010956151 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01635nam a2200313 cb4500</leader><controlfield tag="001">BV010956151</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960918s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26726503</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010956151</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">Embedding negation as failure into a model generation theorem prover</subfield><subfield code="c">by K. Inoue, M. Koshimura & R. Hasegawa</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">22 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">722</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Here, for the first time, we give an implementation which computes answer sets of every class of logic program and deductive database. The proposal is based on bottom-up, incremental, backtrack-free computation of the minimal models of positive disjunctive programs, together with integrity constraints over beliefs and disbeliefs. The procedure has been implemented on top of a model generation theorem prover (MGTP) on a distributed-memory multiprocessor machine (Multi-PSI), and is currently being applied to a legal reasoning system developed at ICOT."</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">Koshimura, Miyuki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hasegawa, Ryuzo</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">722</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">722</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328324</subfield></datafield></record></collection> |
| id | DE-604.BV010956151 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:38Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328324 |
| oclc_num | 26726503 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 22 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 Embedding negation as failure into a model generation theorem prover by K. Inoue, M. Koshimura & R. Hasegawa Tokyo, Japan 1991 22 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 722 Abstract: "Here, for the first time, we give an implementation which computes answer sets of every class of logic program and deductive database. The proposal is based on bottom-up, incremental, backtrack-free computation of the minimal models of positive disjunctive programs, together with integrity constraints over beliefs and disbeliefs. The procedure has been implemented on top of a model generation theorem prover (MGTP) on a distributed-memory multiprocessor machine (Multi-PSI), and is currently being applied to a legal reasoning system developed at ICOT." Automatic theorem proving Koshimura, Miyuki Verfasser aut Hasegawa, Ryuzo Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 722 (DE-604)BV010923438 722 |
| spellingShingle | Inoue, Katsumi Koshimura, Miyuki Hasegawa, Ryuzo Embedding negation as failure into a model generation theorem prover Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Automatic theorem proving |
| title | Embedding negation as failure into a model generation theorem prover |
| title_auth | Embedding negation as failure into a model generation theorem prover |
| title_exact_search | Embedding negation as failure into a model generation theorem prover |
| title_full | Embedding negation as failure into a model generation theorem prover by K. Inoue, M. Koshimura & R. Hasegawa |
| title_fullStr | Embedding negation as failure into a model generation theorem prover by K. Inoue, M. Koshimura & R. Hasegawa |
| title_full_unstemmed | Embedding negation as failure into a model generation theorem prover by K. Inoue, M. Koshimura & R. Hasegawa |
| title_short | Embedding negation as failure into a model generation theorem prover |
| title_sort | embedding negation as failure into a model generation theorem prover |
| topic | Automatic theorem proving |
| topic_facet | Automatic theorem proving |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT inouekatsumi embeddingnegationasfailureintoamodelgenerationtheoremprover AT koshimuramiyuki embeddingnegationasfailureintoamodelgenerationtheoremprover AT hasegawaryuzo embeddingnegationasfailureintoamodelgenerationtheoremprover |