Abstract
Logic programs P and Q are strongly equivalent if, given any logic program R, programs P ∪ R and Q ∪ R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct without considering the whole program. Recently, Lifschitz, Pearce andV alverde showedt hat Heyting’s logic of here-and-there can be used to characterize strong equivalence of logic programs. This paper offers a more direct characterization, and extends it to default logic. In their paper, Lifschitz, Pearce and Valverde study a very general form of logic programs, called“n ested” programs. For the study of strong equivalence of default theories, it is convenient to introduce a corresponding “nested” version of default logic, which generalizes Reiter’s default logic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Michael Gelfondan d Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991. 81
Michael Gelfond, Vladimir Lifschitz, Halina Przymusińska, and Miroslaw Truszczyński. Disjunctive defaults. In James Allen, Richard Fikes, and Erik Sandewall, editors, Principles of Knowledge Representation and Reasoning: Proc. of the 2nd Int’l Conference, pages 230–237, 1991. 82, 87, 88
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. 81, 82, 83, 86, 91
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 http://www.cs.utexas.edu/users/vl/papers.html.) 81, 84
David Pearce. A new logical characterization of stable models andan swer 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. 81
David P earce. From here to there: stable negation in logic programming. In D. Gabbay and H. Wansing, editors, What is Negation? Kluwer, 1999. 81
Raymond R eiter. A logic for default reasoning. Artificial Intelligence, 13(1,2):81–132, 1980. 81
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Turner, H. (2001). Strong Equivalence for Logic Programs and Default Theories (Made Easy). In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_6
Download citation
DOI: https://doi.org/10.1007/3-540-45402-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42593-9
Online ISBN: 978-3-540-45402-1
eBook Packages: Springer Book Archive