Abstract
Default logic is the most popular non monotonic formalism. We present a general framework, defining the classical default extensions as “justified pre-extensions” having a particular property, “stability”. These pre-extensions have a constructive definition, contrary to classical extensions, and they give rise to a notion of “formula provable by default” which has appeared yet under several formulations in the literature. Also, we show how a less known proposal of this kind gives a very interesting “semi-constructive” definition of default extensions. Finally our framework applies to some modal translations of defaults, making precise the relations between the stability in default logic and in autoepistemic modal logic.
This work has been supported by DRUMS, ESPRIT BRA project number 3085.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ph. Besnard. Characterisation of extensions for default logic. Submitted, 1992.
R.A. de T. Guerreiro, M.A. Casanova, and A.S. Hemerly. Contribution to a proof theory for generic defaults. In ECAI, pp 213–218, Pitmman Publ, 1990.
P. J. Krause, P. Byers, and S. Hajnal. Formal Specification of a Database Extension Management System: A Case Study. submitted, 1992.
Kurt Konolige. On the relation beween default and autoepistemic logic. Artificial Intelligence, 35:343–382, 1988. Errata in Artificial Intelligence, 41:115, 1989.
F. Lévy. Computing extensions of default theories. In Symbolic and Quantitavive Approaches to Uncertainty, in LNCS-548, pages 219–226. Springer-Verlag, 1991.
Witold Lukaszewicz. Considerations on default logic: an alternative approach. Computational Intelligence, 4:1–16, 1988.
Witold Lukaszewicz. Non-monotonic Reasoning: formalization of commonsense reasoning. Ellis Horwood, Chichester, UK, 1990.
Y. Moinard. Unifying various approaches to default logic. T.R. IRISA, 1993.
Victor Marek and Miroslaw Truszczyński. Relating autoepistemic and default logics. In Knowledge Representation, pages 276–288, Toronto, 1989.
Ray Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.
C. Schwind, V. Risch. A tableau-based characterisation for default logic. In Symbolic and Quantitative Approaches to Uncertainty, LNCS 548: 310–317. 1991.
P. Siegel, C. Schwind. Hypothesis theory for nonmonotonic reasoning. In Workshop on Non-standard Queries and Answers, pp 189–210, Toulouse, jul. 1991.
Miroslaw Truszczynski. Modal Interpretations of Default Logic. In IJCAI, pages 393–398, Sydney, Morgan Kaufmann, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag
About this paper
Cite this paper
Moinard, Y. (1993). Unifying various approaches to default logic. In: Bouchon-Meunier, B., Valverde, L., Yager, R.R. (eds) IPMU '92—Advanced Methods in Artificial Intelligence. IPMU 1992. Lecture Notes in Computer Science, vol 682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56735-6_41
Download citation
DOI: https://doi.org/10.1007/3-540-56735-6_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56735-6
Online ISBN: 978-3-540-47643-6
eBook Packages: Springer Book Archive