Abstract
In this paper we analyze the conditional logic approach to default logic, the logic that formalizes reasoning about default assumptions. Conditional logic is a popular framework to formalize defeasible reasoning. The conditional sentence “if β (the antecedent or condition) then by default α (the consequent or conclusion)” is represented in this framework by the formula β > α, where ‘>’ is some kind of implication of conditional logic. In this paper different usages of preference orderings for defeasible conditional logics are discussed. The different usages, so-called minimizing and ordering, are represented by different modal operators. Each operator validates different inference rules. Hence, the combination of different modal operators imposes restrictions on the proof theory of the logic. The restriction discussed in this paper is that a proof rule can be blocked in a derivation due to the fact that another proof rule has already been used earlier in the derivation. We call this the two-phase approach in the proof theory.
This research was partially supported by the Esprit III Basic Research Project No.6156 Drums II and the Esprit III Basic Research Working Group No.8319 Modelage.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Boutilier. Conditional logics of normality: a modal approach. Artificial Intelligence, 68:87–154, 1994.
S. Kraus, D. Lehmann, and M. Magidor. Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44:167–207, 1990.
J. Pearl. System Z: a natural ordering of defaults with tractable applications to default reasoning. In Proceedings of the TARK'90, San Mateo, 1990. Morgan Kaufmann.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van der Torre, L.W., Tang, YH. (1997). Reasoning about exceptions (extended abstract). In: Brewka, G., Habel, C., Nebel, B. (eds) KI-97: Advances in Artificial Intelligence. KI 1997. Lecture Notes in Computer Science, vol 1303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540634932_38
Download citation
DOI: https://doi.org/10.1007/3540634932_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63493-5
Online ISBN: 978-3-540-69582-0
eBook Packages: Springer Book Archive