A proof procedure for extended logic programs:
Abstract: "In [GL90], M. Gelfond and V. Lifschitz proposed to extend general logic programs to so-called extended logic programs, by adding strong negation. They proposed answer sets as a semantics for these programs. However, this semantics uses the notion of global consistency. The necessity...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1993
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,59 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In [GL90], M. Gelfond and V. Lifschitz proposed to extend general logic programs to so-called extended logic programs, by adding strong negation. They proposed answer sets as a semantics for these programs. However, this semantics uses the notion of global consistency. The necessity of testing for global consistency makes finding a proof for a specific query w.r.t. a program as hard as finding a complete answer set for that program. In this paper, we abandon the idea of preserving global consistency and propose a modified transformation from extended logic programs to general logic programs, based on a semantics in which only local consistency is preserved We use the notion of conservative derivability, as defined by G. Wagner in [Wag91], as a proof-theoretic semantics for extended logic programs, and show that the three-valued completion semantics of a transformed program is sound and complete with respect to conservative derivability in the original extended logic program. As a result, we can use any proof procedure for general logic programs that is sound with respect to completion semantics, to answer queries with respect to extended logic programs. We illustrate our proof procedure by using it to prove queries with respect to an extended logic program discussed in [GL90]. |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010176810 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950510s1993 |||| 00||| engod | ||
| 035 | |a (OCoLC)31237745 | ||
| 035 | |a (DE-599)BVBBV010176810 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Teusink, Frank |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A proof procedure for extended logic programs |c F. Teusink |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 93,59 | |
| 520 | 3 | |a Abstract: "In [GL90], M. Gelfond and V. Lifschitz proposed to extend general logic programs to so-called extended logic programs, by adding strong negation. They proposed answer sets as a semantics for these programs. However, this semantics uses the notion of global consistency. The necessity of testing for global consistency makes finding a proof for a specific query w.r.t. a program as hard as finding a complete answer set for that program. In this paper, we abandon the idea of preserving global consistency and propose a modified transformation from extended logic programs to general logic programs, based on a semantics in which only local consistency is preserved | |
| 520 | 3 | |a We use the notion of conservative derivability, as defined by G. Wagner in [Wag91], as a proof-theoretic semantics for extended logic programs, and show that the three-valued completion semantics of a transformed program is sound and complete with respect to conservative derivability in the original extended logic program. As a result, we can use any proof procedure for general logic programs that is sound with respect to completion semantics, to answer queries with respect to extended logic programs. We illustrate our proof procedure by using it to prove queries with respect to an extended logic program discussed in [GL90]. | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Logic programming | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,59 |w (DE-604)BV008928356 |9 93,59 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006759449 | ||
Datensatz im Suchindex
| _version_ | 1804124574423449600 |
|---|---|
| any_adam_object | |
| author | Teusink, Frank |
| author_facet | Teusink, Frank |
| author_role | aut |
| author_sort | Teusink, Frank |
| author_variant | f t ft |
| building | Verbundindex |
| bvnumber | BV010176810 |
| ctrlnum | (OCoLC)31237745 (DE-599)BVBBV010176810 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02291nam a2200301 cb4500</leader><controlfield tag="001">BV010176810</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950510s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31237745</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010176810</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="100" ind1="1" ind2=" "><subfield code="a">Teusink, Frank</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A proof procedure for extended logic programs</subfield><subfield code="c">F. Teusink</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">93,59</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In [GL90], M. Gelfond and V. Lifschitz proposed to extend general logic programs to so-called extended logic programs, by adding strong negation. They proposed answer sets as a semantics for these programs. However, this semantics uses the notion of global consistency. The necessity of testing for global consistency makes finding a proof for a specific query w.r.t. a program as hard as finding a complete answer set for that program. In this paper, we abandon the idea of preserving global consistency and propose a modified transformation from extended logic programs to general logic programs, based on a semantics in which only local consistency is preserved</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We use the notion of conservative derivability, as defined by G. Wagner in [Wag91], as a proof-theoretic semantics for extended logic programs, and show that the three-valued completion semantics of a transformed program is sound and complete with respect to conservative derivability in the original extended logic program. As a result, we can use any proof procedure for general logic programs that is sound with respect to completion semantics, to answer queries with respect to extended logic programs. We illustrate our proof procedure by using it to prove queries with respect to an extended logic program discussed in [GL90].</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">Logic programming</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">93,59</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,59</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006759449</subfield></datafield></record></collection> |
| id | DE-604.BV010176810 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006759449 |
| oclc_num | 31237745 |
| open_access_boolean | |
| physical | 12 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Teusink, Frank Verfasser aut A proof procedure for extended logic programs F. Teusink Amsterdam 1993 12 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,59 Abstract: "In [GL90], M. Gelfond and V. Lifschitz proposed to extend general logic programs to so-called extended logic programs, by adding strong negation. They proposed answer sets as a semantics for these programs. However, this semantics uses the notion of global consistency. The necessity of testing for global consistency makes finding a proof for a specific query w.r.t. a program as hard as finding a complete answer set for that program. In this paper, we abandon the idea of preserving global consistency and propose a modified transformation from extended logic programs to general logic programs, based on a semantics in which only local consistency is preserved We use the notion of conservative derivability, as defined by G. Wagner in [Wag91], as a proof-theoretic semantics for extended logic programs, and show that the three-valued completion semantics of a transformed program is sound and complete with respect to conservative derivability in the original extended logic program. As a result, we can use any proof procedure for general logic programs that is sound with respect to completion semantics, to answer queries with respect to extended logic programs. We illustrate our proof procedure by using it to prove queries with respect to an extended logic program discussed in [GL90]. Automatic theorem proving Logic programming Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,59 (DE-604)BV008928356 93,59 |
| spellingShingle | Teusink, Frank A proof procedure for extended logic programs Automatic theorem proving Logic programming |
| title | A proof procedure for extended logic programs |
| title_auth | A proof procedure for extended logic programs |
| title_exact_search | A proof procedure for extended logic programs |
| title_full | A proof procedure for extended logic programs F. Teusink |
| title_fullStr | A proof procedure for extended logic programs F. Teusink |
| title_full_unstemmed | A proof procedure for extended logic programs F. Teusink |
| title_short | A proof procedure for extended logic programs |
| title_sort | a proof procedure for extended logic programs |
| topic | Automatic theorem proving Logic programming |
| topic_facet | Automatic theorem proving Logic programming |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT teusinkfrank aproofprocedureforextendedlogicprograms |