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.
|Title of host publication||Logic Programming and Nonmonotonic Reasoning - 3rd International Conference, LPNMR 1995, Proceedings|
|Editors||V. Wiktor Marek, Miroslaw Truszczynski, Anil Nerode|
|Number of pages||14|
|State||Published - 1995|
|Event||3rd International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1995 - Lexington, United States|
Duration: Jun 26 1995 → Jun 28 1995
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||3rd International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1995|
|Period||6/26/95 → 6/28/95|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1995.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)