Abstract
In this paper we develop an algebraic framework for studying semantics of nonmonotonic logics. Our approach is formulated in the language of lattices, bilattices, operators and fixpoints. The goal is to describe fixpoints of an operator O defined on a lattice. The key intuition is that of an approximation, a pair (x, y) of lattice elements which can be viewed as an approximation to each lattice element z such that x ≤ z ≤ y. The key notion is that of an approximating operator, a monotone operator on the bilattice of approximations whose fixpoints approximate the fixpoints of the operator O. The main contribution of the paper is an algebraic construction which assigns a certain operator, called the stable operator, to every approximating operator on a bilattice of approximations. This construction leads to an abstract version of the well–founded semantics. In the paper we show that our theory offers a unified framework for semantic studies of logic programming, default logic and autoepistemic logic.
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
Preview
Unable to display preview. Download preview PDF.
References
Baral, C. and Subrahmanian, V. (1991). Dualities between alternative semantics for logic programming and nonmonotonic reasoning (extended abstract). In A. Nerode, W. Marek, and V.S. Subrahmanian, editors, Logic programming and non-monotonic reasoning (Washington, DC, 1991), pages 69–86, Cambridge, MA. MIT Press.
Bochman, A. (1996). Biconsequence Relations for Nonmonotonic Reasoning. In L. Carlucci Aiello, J. Doyle, and S. Shapiro, editors, Principles of Knowledge Representation and Reasoning, Proceedings of the Fifth International Conference (KR96), pages 482–492, Morgan Kaufmann Publishers.
Bochman, A. (1998a). A Logical Foundation for Logic Programming I: Biconsequence Relations. Journal of Logic Programming 35:151–170.
Bochman, A. (1998b). A Logical Foundation for Logic Programming II: Semantics of General Logic Programs. Journal of Logic Programming 35:171–194.
Bidoit, N. and Froidevaux, C. (1991). Negation by default and unstratifiable logic programs. Theoretical Computer Science, 78(1, (Part B)):85–112.
Brass, S. and Dix, J. (1999), Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming 38:167–213.
Denecker, M. (1998). The well-founded semantics is the principle of inductive definition. In J. Dix, L.F. Farinas del Cerro, and U. Furbach, editors, Logics in Artificial Intelligence, pages 1–16. Springer-Verlag.
Denecker, M., Marek, V., and Truszczyński, M. (1998). Fixpoint 3-valued semantics for autoepistemic logic. In B.G. Buchanan and R. Uthurusamy, editors, Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI–98), pages 840–845. MIT Press.
Denecker, M., Marek, V., and Truszczyński, M. (2000). Unified semantic treatment of default and autoepistemic logics. In A.G. Cohn, F. Giunchiglia, and B. Selman, editors, Principles of Knowledge Representation and Reasoning, Proceedings of the Seventh International Conference (KR2000), pages 840–845, Morgan Kaufmann Publishers.
Fitting, M. C. (1999). Fixpoint semantics for logic programming — a survey. Theoretical Computer Science. To appear. Available at: http://comet.lehman.cuny.edu/fitting/bookspapers/logprog.html
Gelfond, M. and Lifschitz, V. (1988). The stable semantics for logic programs. In R. Kowalski, and K. Bowen, editors, Proceedings of the 5th International Symposium on Logic Programming, pages 1070–1080, Cambridge, MA. MIT Press.
Ginsberg, M. (1988). Multivalued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence, 4:265–316.
Guerreiro, R. and Casanova, M. (1990). An alternative semantics for default logic. Preprints for The Third International Workshop on Nonmonotonic Reasoning, South Lake Tahoe, pages 141–157.
Konolige, K. (1988). On the relation between default and autoepistemic logic. Artificial Intelligence, 35(3):343–382.
Marek, W. and Truszczyński, M. (1989a). Relating autoepistemic and default logics. In R.J. Brachman, H.J. Levesque, and R. Reiter, editors, Principles of Knowledge Representation and Reasoning, Proceedings of the First International Conference (KR89), pages 276–288, Morgan Kaufmann Publishers.
Marek, W. and Truszczyński, M. (1989b). Stable semantics for logic programs and default theories. In E.Lusk and R. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 243–256. MIT Press.
Moore, R. (1984). Possible-world semantics for autoepistemic logic. In Proceedings of the Workshop on Non-Monotonic Reasoning, pages 344–354. Reprinted in: M. Ginsberg, editor, Readings on nonmonotonic reasoning, pp. 137–142, Morgan Kaufmann, 1990.
Moore, R. (1985). Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25(l):75–94.
Przymusinski, T. (1990). The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445–464.
Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence, 13(1–2):81–132.
Tarski, A. (1955). Lattice-theoretic fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285–309.
van Emden, M. and Kowalski, R. (1976). The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733–742.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Denecker, M., Marek, V., Truszczyński, M. (2000). Approximations, Stable Operators, Well-Founded Fixpoints and Applications in Nonmonotonic Reasoning. In: Minker, J. (eds) Logic-Based Artificial Intelligence. The Springer International Series in Engineering and Computer Science, vol 597. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1567-8_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1567-8_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5618-9
Online ISBN: 978-1-4615-1567-8
eBook Packages: Springer Book Archive