Abstract
In this paper we analyze the semantical definition of extensions for open default theories. We argue that this definition reflects the domain closure assumption and show how the domain closure assumption for countable and finite domains can be expressed in first-order default logic extended with the Carnap rule of inference. Also we give examples of the domain dependence of extensions for open default theories. In particular, we show that such extensions do not possess the minimality property.
The work of this author was partially supported by a grant of the German Israeli Foundation (GIF).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C.C. Chang and H.J. Keisler, Model Theory, North Holland Publishing Co., Amsterdam, 1990.
M.A. Dickmann, Large Infinitary Languages, North Holland Publishing Co., Amsterdam, 1975.
R. Guerreiro and M. Casanova, An alternative semantics for default logic, preprint, the Third International Workshop on Nonmonotonic Reasoning, South Lake Tahoe, 1990.
M. Kaminski, A Comparative Study of Open Default Theories, Artificial Intelligence 77 (1995), 285–319.
K. Konolige, Quantification in autoepistemic logic, Fundamenta Informaticae XV (1991), 275–300.
V. Lifschitz, On open defaults, in Computational Logic: Symposium Proceedings, J.W. Lloyd Ed., Springer-Verlag, Berlin, 1990, pp. 80–95.
J.W. Lloyd, Foundations of Logic Programming, Second Extended Edition, Springer-Verlag, Berlin, 1993.
E. Mendelson, Introduction to Mathematical Logic, Wadsworth and Brooks, Monterey, California, 1987.
D. Poole, A logical framework for default reasoning, Artificial Intelligence 36 (1988), 27–47.
R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980), 81–132.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaminski, M., Makowsky, J.A., Tiomkin, M. (1996). Extensions for open default theories via the domain closure assumption. In: Alferes, J.J., Pereira, L.M., Orlowska, E. (eds) Logics in Artificial Intelligence. JELIA 1996. Lecture Notes in Computer Science, vol 1126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61630-6_26
Download citation
DOI: https://doi.org/10.1007/3-540-61630-6_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61630-6
Online ISBN: 978-3-540-70643-4
eBook Packages: Springer Book Archive