Negation in disjunctive logic programs:
Abstract: "In this paper, we study inferring negation from disjunctive logic programs. First, we consider extensions of the GCWA and the WGCWA for general disjunctive programs based upon the stable model semantics. We define new rules [sic] the GCWA[symbol] and the WGCWA[symbol] which are natur...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1992
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
825 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In this paper, we study inferring negation from disjunctive logic programs. First, we consider extensions of the GCWA and the WGCWA for general disjunctive programs based upon the stable model semantics. We define new rules [sic] the GCWA[symbol] and the WGCWA[symbol] which are natural extensions of the GCWA and the WGCWA. Second, we introduce a new semantics called the possible world semantics for general disjunctive programs, which was initially introduced in [Sak89] for positive disjunctive programs. The possible world assumption (PWA) infers negation under the possible world semantics, which lies between the GCWA and the WGCWA in positive disjunctive programs The PWA is also extended to the PWA[symbol] for general disjunctive programs. Then it is shown that the PWA[symbol] provides the most careful negative inference compared with the GCWA[symbol] and the WGCWA[symbol]. We also present a bottom-up model generation proof procedure to compute each negation in general disjunctive programs. |
| Beschreibung: | 19 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010957553 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960919s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)29209061 | ||
| 035 | |a (DE-599)BVBBV010957553 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Sakama, Chiaki |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Negation in disjunctive logic programs |c by C. Sakama & K. Inoue |
| 264 | 1 | |a Tokyo, Japan |c 1992 | |
| 300 | |a 19 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 825 | |
| 520 | 3 | |a Abstract: "In this paper, we study inferring negation from disjunctive logic programs. First, we consider extensions of the GCWA and the WGCWA for general disjunctive programs based upon the stable model semantics. We define new rules [sic] the GCWA[symbol] and the WGCWA[symbol] which are natural extensions of the GCWA and the WGCWA. Second, we introduce a new semantics called the possible world semantics for general disjunctive programs, which was initially introduced in [Sak89] for positive disjunctive programs. The possible world assumption (PWA) infers negation under the possible world semantics, which lies between the GCWA and the WGCWA in positive disjunctive programs | |
| 520 | 3 | |a The PWA is also extended to the PWA[symbol] for general disjunctive programs. Then it is shown that the PWA[symbol] provides the most careful negative inference compared with the GCWA[symbol] and the WGCWA[symbol]. We also present a bottom-up model generation proof procedure to compute each negation in general disjunctive programs. | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Inoue, Katsumi |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 825 |w (DE-604)BV010923438 |9 825 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007329568 | ||
Datensatz im Suchindex
| _version_ | 1804125444998430720 |
|---|---|
| any_adam_object | |
| author | Sakama, Chiaki Inoue, Katsumi |
| author_facet | Sakama, Chiaki Inoue, Katsumi |
| author_role | aut aut |
| author_sort | Sakama, Chiaki |
| author_variant | c s cs k i ki |
| building | Verbundindex |
| bvnumber | BV010957553 |
| ctrlnum | (OCoLC)29209061 (DE-599)BVBBV010957553 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01995nam a2200313 cb4500</leader><controlfield tag="001">BV010957553</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960919s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29209061</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010957553</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">Sakama, Chiaki</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Negation in disjunctive logic programs</subfield><subfield code="c">by C. Sakama & K. Inoue</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">825</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper, we study inferring negation from disjunctive logic programs. First, we consider extensions of the GCWA and the WGCWA for general disjunctive programs based upon the stable model semantics. We define new rules [sic] the GCWA[symbol] and the WGCWA[symbol] which are natural extensions of the GCWA and the WGCWA. Second, we introduce a new semantics called the possible world semantics for general disjunctive programs, which was initially introduced in [Sak89] for positive disjunctive programs. The possible world assumption (PWA) infers negation under the possible world semantics, which lies between the GCWA and the WGCWA in positive disjunctive programs</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The PWA is also extended to the PWA[symbol] for general disjunctive programs. Then it is shown that the PWA[symbol] provides the most careful negative inference compared with the GCWA[symbol] and the WGCWA[symbol]. We also present a bottom-up model generation proof procedure to compute each negation in general disjunctive programs.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</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="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">825</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">825</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007329568</subfield></datafield></record></collection> |
| id | DE-604.BV010957553 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:40Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007329568 |
| oclc_num | 29209061 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 19 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| 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 | Sakama, Chiaki Verfasser aut Negation in disjunctive logic programs by C. Sakama & K. Inoue Tokyo, Japan 1992 19 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 825 Abstract: "In this paper, we study inferring negation from disjunctive logic programs. First, we consider extensions of the GCWA and the WGCWA for general disjunctive programs based upon the stable model semantics. We define new rules [sic] the GCWA[symbol] and the WGCWA[symbol] which are natural extensions of the GCWA and the WGCWA. Second, we introduce a new semantics called the possible world semantics for general disjunctive programs, which was initially introduced in [Sak89] for positive disjunctive programs. The possible world assumption (PWA) infers negation under the possible world semantics, which lies between the GCWA and the WGCWA in positive disjunctive programs The PWA is also extended to the PWA[symbol] for general disjunctive programs. Then it is shown that the PWA[symbol] provides the most careful negative inference compared with the GCWA[symbol] and the WGCWA[symbol]. We also present a bottom-up model generation proof procedure to compute each negation in general disjunctive programs. Logic programming Inoue, Katsumi Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 825 (DE-604)BV010923438 825 |
| spellingShingle | Sakama, Chiaki Inoue, Katsumi Negation in disjunctive logic programs Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Logic programming |
| title | Negation in disjunctive logic programs |
| title_auth | Negation in disjunctive logic programs |
| title_exact_search | Negation in disjunctive logic programs |
| title_full | Negation in disjunctive logic programs by C. Sakama & K. Inoue |
| title_fullStr | Negation in disjunctive logic programs by C. Sakama & K. Inoue |
| title_full_unstemmed | Negation in disjunctive logic programs by C. Sakama & K. Inoue |
| title_short | Negation in disjunctive logic programs |
| title_sort | negation in disjunctive logic programs |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT sakamachiaki negationindisjunctivelogicprograms AT inouekatsumi negationindisjunctivelogicprograms |