Abstract
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justifications are never used together in constructing a set of default consequences of a theory; (2) the reasoning formalized by our logic is related to the traditional skeptical mode of default reasoning. Our logic is based on the concept of a skeptical rational extension. We give characterization results for skeptical rational extensions and an algorithm to compute them. We present some complexity results. Our main goal is to characterize cases when the class of skeptical rational extensions is closed under intersection. In the case of normal default theories our logic coincides with the standard skeptical reasoning with extensions. In the case of seminormal default theories our formalism provides a description of the standard skeptical reasoning with rational extensions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Besnard. An introduction to default logic. Springer-Verlag, Berlin, 1989.
G. Brewka. Cumulative default logic: in defense of nonmonotonic inference rules. Artificial Intelligence, 50:183–205, 1991.
G. Brewka. Nonmonotonic reasoning: logical foundations of commonsense. Cambridge University Press, Cambridge, UK, 1991.
M. Gelfond, V. Lifschitz, H. Przymusinska, and M. Truszczyński. Disjunctive defaults. In Second international conference on principles of knowledge representation and reasoning, KR '91, Cambridge, MA, 1991.
G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2:397–425, 1992.
W. Marek and M. Truszczyński. Nonmonotonic logics; context-dependent reasoning. Berlin: Springer-Verlag, 1993.
A. Mikitiuk and M. Truszczyński. Rational default logic and disjunctive logic programming. In A. Nerode and L. Pereira, editors, Logic programming and non-monotonic reasoning, pages 283–299. MIT Press, 1993.
A. Mikitiuk and M. Truszczyński. Constrained and rational default logic. In preparation, 1995.
D. Poole. What the lottery paradox tells us about default reasoning. In Proceedings of the 2nd conference on principles of knowledge representation and reasoning, KR '89, pages 333–340, San Mateo, CA., 1989. Morgan Kaufmann.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.
T. Schaub. Considerations on Default Logics. PhD thesis, Technischen Hochschule Darmstadt, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mikitiuk, A., Truszczyński, M. (1995). Skeptical rational extensions. In: Marek, V.W., Nerode, A., Truszczyński, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1995. Lecture Notes in Computer Science, vol 928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59487-6_19
Download citation
DOI: https://doi.org/10.1007/3-540-59487-6_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59487-1
Online ISBN: 978-3-540-49282-5
eBook Packages: Springer Book Archive