Abstract
The original definition of autoepistemic expansions requires an agent to know of every proposition, whether it is or is not in his belief set. This restriction to complete belief introspection appears to be too strict for knowledge base applications, as it implies that a whole knowledge base is invalidated as soon as it is partially implausible. The proposal presented in this paper is a constructive approach based on incomplete belief introspection. It is defined by a monotone operator and the following can be shown to hold: Complete fixpoints correspond exactly to autoepistemic expansions. Complete least fixpoints are moderately grounded and for logic programs the least fixpoint coincides with the well-founded semantics.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Brian F. Chellas. Modal Logic — An Introduction. Cambridge University Press, Cambridge, 1980
Jaakko Hintikka. Knowledge and Belief. Cornell University Press, Ithaca, New York, 1962
Kurt Konolige. On the Relation between Default and Autoepistemic Logic. Artificial Intelligence 35, pp. 343–382, 1988
Wiktor Marek, Miroslaw Truszczynski. Relating autoepistemic and default logics. Proc. of the 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, pp. 276–288, 1989
Robert C. Moore. Semantical Considerations on Nonmonotonic Logic. Artificial Intelligence 25, pp. 75–94, 1985
Allen Newell. The Knowledge Level. Artificial Intelligence 18, pp. 87–127, 1982
H. Przymusinska, T. Przymusinski. Semantic Issues in Deductive Databases and Logic Programs, in: R.B. Banerji (Ed.), Formal Techniques in Artificial Intelligence, North-Holland, pp. 321–367, 1990
Teodor Przymusinski. Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming. Proc. of the 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, pp. 341–348, 1989
M. H. van Emden, R. A. Kowalski. The Semantics of Predicate Logic as a Programming Language. Journal of the ACM 23, 4, pp. 733–742, 1976
Allen Van Gelder. The Alternating Fixpoint of Logic Programs with Negation. Proc. of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 1–10, 1989
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalinski, J. (1991). Autoepistemic expansions with incomplete belief introspection. In: Dix, J., Jantke, K.P., Schmitt, P.H. (eds) Nonmonotonic and Inductive Logic. NIL 1990. Lecture Notes in Computer Science, vol 543. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023326
Download citation
DOI: https://doi.org/10.1007/BFb0023326
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54564-4
Online ISBN: 978-3-540-38469-4
eBook Packages: Springer Book Archive