Abstract
Logical approaches to nonmonotonic reasoning have been developed within different technical settings, thus making it difficult to establish correspondences among them and to identify common underlying principles. In this paper we argue that the most well-known nonmonotonic reasoning formalisms are actually characterized by two closure assumptions: a minimal knowledge assumption and an autoepistemic assumption. We justify this thesis by introducing generalized default logic (GDL), obtained through a simple and natural generalization of Reiter’s default logic, which fully captures both closure assumptions. We then analyze the relationship between GDL and nonmonotonic modal logics, in particular Moore’s autoepistemic logic and Lifschitz’s logic of minimal knowledge and negation as failure, showing the existence of a full correspondence between these modal formalisms and GDL. Such a correspondence gives us a unified reading of nonmonotonic reasoning formalisms in terms of the above two assumptions; in particular, it clarifies the relationship between default and autoepistemic logic.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Bochman. Biconsequence relations for nonmonotonic reasoning. In Proc. of the 5th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR’96), 1996.
J. Chen. The logic of only knowing as a unified framework for nonmonotonic reasoning. Fundamenta Informaticae, 21:205–220, 1994.
[Donini et al., 1997]_Francesco M. Donini, Daniele Nardi, and Riccardo Rosati. Ground nonmonotonic modal logics. J. of Logic and Computation, 7(4):523–548, August 1997.
M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.
[Gelfond et al., 1991]_M. Gelfond, V. Lifschitz, H. Przymusinska, and M. Truszczynski. Disjunctive defaults. In Proc. of the 2nd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR’ 91), pages 230–237. Morgan Kaufmann, Los Altos, 1991.
Matthew L. Ginsberg, editor. Readings in Nonmonotonic Reasoning. Morgan Kaufmann, Los Altos, 1987.
G. Gottlob. Translating default logic into standard autoepistemic logic. J. of the ACM, 42:711–740, 1995.
Joseph Y. Halpern and Yoram Moses. Towards a theory of knowledge and ignorance: Preliminary report. Technical Report CD-TR 92/34, IBM, 1985.
G. E. Hughes and M. J. Cresswell. An Introduction to Modal Logic. Methuen University Press, London, 1968.
K. Inoue and C. Sakama. On positive occurrences of negation as failure. In Proc. of the 4th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR’94), pages 293–304. Morgan Kaufmann, Los Altos, 1994.
Tomi Janhunen. Representing autoepistemic introspection in terms of default rules. In Proc. of the 12th European Conf. on Artificial Intelligence (ECAI’96), 1996.
D. S. Johnson. A catalog of complexity classes. In J. van Leuven, editor, Handbook of Theoretical Computer Science, volume A, chapter 2. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.
K. Konolige. On the relationship between default and autoepistemic logic. Artificial Intelligence, 35:343–382, 1988.
Hector J. Levesque. All I know: a study in autoepistemic logic. Artificial Intelligence, 42:263–310, 1990.
Vladimir Lifschitz. Nonmonotonic databases and epistemic queries. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI’91), pages 381–386, 1991.
F. Lin and Y. Shoham. Epistemic semantics for fixed-point non-monotonic logics. Artificial Intelligence, 57:271–289, 1992.
W. Marek and M. Truszczyński. Nonmonotonic Logics-Context-Dependent Reasoning. Springer-Verlag, 1993.
R. C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25:75–94, 1985.
Raymond Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980. Republished in [Ginsberg, 1987].
Riccardo Rosati. Embedding minimal knowledge into autoepistemic logic. In Proc. of the 5th Conf. of the Italian Association for Artificial Intelligence (AI*IA’97), number 1321 in Lecture Notes In Artificial Intelligence, pages 231–241. Springer-Verlag, 1997.
Riccardo Rosati. Reasoning with minimal belief and negation as failure: Algorithms and complexity. In Proc. of the 14th Nat. Conf. on Artificial Intelligence (AAAI’97), pages 430–435. AAAI Press/The MIT Press, 1997.
G. Schwarz and V. Lifschitz. Extended logic programs as autoepistemic theories. In Proc. of the 2nd Int. Workshop on Logic Programming and Non-monotonic Reasoning (LPNMR’93), pages 101–114. The MIT Press, 1993.
G. Schwarz and M. Truszczyński. Minimal knowledge problem: a new approach. Artificial Intelligence, 67:113–141, 1994.
G. Schwarz. Minimal model semantics for nonmonotonic modal logics. In Proc. of the 7th IEEE Sym. on Logic in Computer Science (LICS’92), pages 34–43. IEEE Computer Society Press, 1992.
G. Schwarz. On embedding default logic into Moore’s autoepistemic logic. Artificial Intelligence, 80:388–392, 1996.
Y. Shoham. Nonmonotonic logics: Meaning and utility. In Proc. of the 10th Int. Joint Conf. on Artificial Intelligence (IJCAI’87), pages 388–392, 1987.
Robert Stalnaker. A note on non-monotonic modal logic. Artificial Intelligence, 64(2):183–196, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nardi, D., Rosati, R. (2000). Generalized default logic: minimal knowledge, autoepistemic and default reasoning reconciled. In: Lamma, E., Mello, P. (eds) AI*IA 99: Advances in Artificial Intelligence. AI*IA 1999. Lecture Notes in Computer Science(), vol 1792. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46238-4_1
Download citation
DOI: https://doi.org/10.1007/3-540-46238-4_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67350-7
Online ISBN: 978-3-540-46238-5
eBook Packages: Springer Book Archive