Abstract
Przymusinski proposed [11] AELB, the autoepistemic logic of knowledge and belief. The AELB logic is a very powerful and expressive formal system which isomorphically contains various major non-monotonic knowledge representation formalisms and major logic program semantics. Thus AELB can be used as a unifying framework for non-monotonic knowledge representation formalisms, which allows us to compare and better understand different formalizations of common-sense knowledge.
The notion of “static autoepistemic expansion” forms the semantic basis for reasoning in AELB logic. However, not all AELB theories have consistent static expansions. In this paper, we identify a class of AELB theories, namely, the stratified AELB programs, and show that every stratified program has a unique consistent least static expansion. The existence of the consistent least static expansion is an important property which assures the usefulness of inferencing in such AELB theories.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Brass, J. Dix, T. Przymusinski. Super Logic Programs. Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR’96), Vancouver, Canada, Morgan Kaufmann, 1996.
M. Gelfond. Logic Programming and Reasoning with Incomplete Information. Annals of Mathematics and Artificial Intelligence, 12: 89–116, 1994.
M. Gelfond, V. Lifschitz. The Stable Model Semantics for Logic Programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, Cambridge, MA, 1988, pp. 1070–1080.
M. Gelfond, H. Przymusinska, T. Przymusinski. On the Relationship between Circumscription and Negation as Failure. Artificial Intelligence, 38: 75–94, 1989.
V. Lifschitz, Minimal Belief and Negation as Failure. Artificial Intelligence, 70: 53–72, 1994.
J. McCarthy. Circumscription—A Form of Non-monotonic Reasoning. Artificial Intelligence, 13: 27–39, 1980.
W. Marek and M. Truszczynski. Non-Monotonic Logic. Springer-Verlag, 1994.
R. Moore. Semantical Considerations on Non-Monotonic Logic. Artificial Intelligence, 25: 75–94, 1985.
T. Przymusinski. On the Declarative Semantics of Deductive Databases and Logic Programs. In J. Minker, Editor, Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 193–216.
T. Przymusinski, Semantics of Normal and Disjunctive Logic Programs: A Unifying Framework. Proceedings of the Workshop on Non-Monotonic Extensions of Logic Programming at the 11th International Logic Programming Conference, Springer-Verlag, 1995, pp. 43–67.
T. Przymusinski. Autoepistemic Logic of Knowledge and Beliefs, Artificial Intelligence, In Press.
R. Reiter. On Closed World Data Bases. In H. Gallaire and J. Minker, Editors, Logic and Data Bases, Plenum Press, New York, 1978, pp. 55–76.
A. Van Gelder, K.A. Ross, and J.S. Schlipf. The Well-Founded Semantics for General Logic Programs. Journal of the ACM, 38(3): 620–650, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J. (1999). A class of stratified programs in autoepistemic logic of knowledge and belief. In: Raś, Z.W., Skowron, A. (eds) Foundations of Intelligent Systems. ISMIS 1999. Lecture Notes in Computer Science, vol 1609. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095091
Download citation
DOI: https://doi.org/10.1007/BFb0095091
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65965-5
Online ISBN: 978-3-540-48828-6
eBook Packages: Springer Book Archive