Abstract
Default logic, introduced by Reiter, is an effective nonmonotonic reasoning system. In addition to being a stand alone paradigm for nonmonotonic reasoning, default logic has also been used to represent other nonmonotonic reasoning systems such as the stable model semantics and the well-founded semantics of logic programs. This paper complements these results by describing a sound and complete resolution based proof procedure for a large class of default theories.
The procedure can be used to determine if an arbitrary formula is in an extension. It also has the advantage of generating a partial extension, which is contained in the final extension, thus helping to describe the meaning of a given default theory. Further, the procedure does not necessarily have to compute every extension in order for a single query to be answered. The procedure has been implemented in C-Prolog.
Partial support was provided by the National Science Foundation, under grant Nr. IRI-92-10220.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Barback. Default theories: proof procedures and the relation to nonmonotonic logics. PhD thesis, Northwestern University, Department of Electrical Engineering and Computer Science, 1994.
P. Besnard. An Introduction to Default Logic. Springer, Berlin, Heidelberg, 1989.
N. Bidoit and C. Froidevaux. General logical databases and programs: Default logic semantics and stratification. Information and Computation, 91:15–54, 1991.
Chitta R. Baral and V.S. Subrahmanian. Stable extension class theory for logic programs and default logis. Journal of Automated Reasoning, pages 246–260, 1991.
K. Eshghi and R.A. Kowalski. Abduction compared with negation by failure. In Proceedings of the 6th ICLP, pages 234–253, 1989.
David W. Etherington. Formalizing nonmonotonic reasoning systems. Artificial Intelligence, 31:41–85, 1987.
David W. Etherington. Reasoning with Incomplete Information. Morgan Kaufmann, 1988.
M. Gelfond, V. Lifschitz, H. Przymusińska, and M. Truszczyński. Disjunctive defaults. In J. Allen, R. Fikes, and E. Sandewall, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Second International Conference, pages 230–237, San Mateo, California, April 22–25 1991. Morgan Kaufmann.
J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.
J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, 1992.
J. Lobo and V.S. Subrahmanian. Relating minimal models to prerequisite free normal defaults. Information Processing Letters, 44:129–133, 1992.
W. Marek and M. Truszczynski. Stable semantics for logic programs and default theories. In Proceedings of the NACLP, pages 243–256, 1989.
W. Marek and M. Truszczynski. Non-monotonic Logic. Springer-Verlag, 1993.
C.H. Papadimitriou and M. Sideri. On finding extensions of default theories. In G. Goos and J. Hartmanis, editors, International Conference on Database Theory, pages 276–281. Springer-Verlag, 1992.
Raymond Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barback, M.D., Lobo, J. (1995). A resolution-based procedure for default theories with extensions. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Non-Monotonic Extensions of Logic Programming. NMELP 1994. Lecture Notes in Computer Science, vol 927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030662
Download citation
DOI: https://doi.org/10.1007/BFb0030662
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59467-3
Online ISBN: 978-3-540-49272-6
eBook Packages: Springer Book Archive