Abstract
In this paper, we investigate the proof theory of default reasoning. We generalize Reiter's framework to a monotonic reasoning system, and in particular allow formulae with nested defaults. We give proof rules for this extended default logic, called default ionic logic, and give deduction theorems. We also give examples of applications of our framework to some well-known problems: weak implication, disjunctive information, default transformation, and normal versus non-normal defaults.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Lukaszewicz W. Two results on default logic, Proc. IJCAI-85, (1985), pp. 459–461
McDermott D. and Doyle J. Non-monotonic logic I, Artificial Intelligence 13, (1980), pp. 27–39.
Nait Abdallah M. A. Ions and local definitions in logic programming, Springer LNCS 210 (1986), pp. 60–72
Poole D. A logical framework for default reasoning, U. of Waterloo report CS-87-59 (1987)
Reiter R. A logic for default reasoning, Artificial Intelligence 13, (1980), pp. 81–132
Reiter R. and Criscuolo G. On interacting defaults, Proc IJCAI-81, pp. 270–276
Sombé L. Inférences non-classiques en intelligence artificielle in Actes des Journees Nationales Intelligence Artificielle, D. Pastre ed., Teknea (1988) pp. 137–230
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nait Abdallah, M.A. (1989). An extended framework for default reasoning. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_33
Download citation
DOI: https://doi.org/10.1007/3-540-51498-8_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51498-5
Online ISBN: 978-3-540-48180-5
eBook Packages: Springer Book Archive