Strong equivalence for logic programs and default theories (Made Easy)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2173 LNAI, Issue , 2001, Pages 81-92

  Turner, Hudson ^a  

^a UNIVERSITY OF MINNESOTA DULUTH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; DEFAULT LOGIC; DEFAULT THEORY; EQUIVALENT TRANSFORMATIONS; LOGIC PROGRAMS;

LOGIC PROGRAMMING;

FORMAL LOGIC;

EID: 84864208682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_6     Document Type: Conference Paper

References (7)

1. Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
2. Michael Gelfond, Vladimir Lifschitz, Halina Przymusińska, and Miroslaw Truszczyński. Disjunctive defaults. In James Allen, Richard Fikes, and Erik Sande-wall, editors, Principles of Knowledge Representation and Reasoning: Proc. of the 2nd Int'l Conference, pages 230-237, 1991.
3. Vladimir Lifschitz, L. R. Tang, and Hudson Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25(2-3):369-390, 1999.
4. Vladimir Lifschitz, David Pearce, and Agustín Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, To appear, 2001. (Pre-print version available at www.cs.utexas.edu/users/vl/papers.html.)
5. David Pearce. A new logical characterization of stable models and answer sets. In Jürgen Dix, Luis Pereira, and Teodor Przymusinski, editors, Non-Monotonic Extensions of Logic Programming (Lecture Notes in Artificial Intelligence 1216), pages 57-70. Springer-Verlag, 1997.
6. David Pearce. From here to there: stable negation in logic programming. In D. Gabbay and H. Wansing, editors, What is Negation? Kluwer, 1999.
7. RaymondReiter. A logic for default reasoning. Artificial Intelligence, 13(1, 2):81-132, 1980.