Abstract
In Chap. 5 we saw how properties of stable models expressed by Theorem on Facts, Theorem on Irrelevant Formulas, and Theorem on Constraints can be used sometimes to calculate the stable models of a program without referring to the definition of a stable model directly. This chapter discusses other useful properties of stable models.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Luitzen Egbertus Jan Brouwer. Über die Bedeutung des Satzes vom ausgeschlossenen Dritten in der Mathematik, insbesondere in der Funktiontheorie. Journal für die reine und angewandte Mathematik, 154:1–7, 1923.
Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.
Esra Erdem and Vladimir Lifschitz. Fages’ theorem for programs with nested expressions. In Proceedings of International Conference on Logic Programming (ICLP), pages 242–254, 2001.
Esra Erdem and Vladimir Lifschitz. Tight logic programs. Theory and Practice of Logic Programming, 3:499–518, 2003.
François Fages. Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51–60, 1994.
Amelia Harrison, Vladimir Lifschitz, and Fangkai Yang. The semantics of Gringo and infinitary propositional formulas. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR), 2014.
Arend Heyting. Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie von Wissenschaften. Physikalisch-mathematische Klasse, pages 42–56, 1930.
Yuliya Lierler. SAT-Based Answer Set Programming. PhD thesis, University of Texas at Austin, 2010.
Vladimir Lifschitz, David Pearce, and Agustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526–541, 2001.
Fangzhen Lin and Yuting Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence, 157:115–137, 2004.
John Lloyd and Rodney Topor. Making Prolog more expressive. Journal of Logic Programming, 1:225–240, 1984.
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, 1997.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Lifschitz, V. (2019). Mathematics of Stable Models. In: Answer Set Programming. Springer, Cham. https://doi.org/10.1007/978-3-030-24658-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-24658-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24657-0
Online ISBN: 978-3-030-24658-7
eBook Packages: Computer ScienceComputer Science (R0)