A modal logic for subjective default reasoning
โ Scribed by Shai Ben-David; Rachel Ben-Eliyahu-Zohary
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 168 KB
- Volume
- 116
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we introduce DML: Default Modal Logic. DML is a logic endowed with a two-place modal connective that has the intended meaning of "If ฮฑ, then normally ฮฒ". On top of providing a well-defined tool for analyzing common default reasoning, DML allows nesting of the default operator. We present a semantic framework in which many of the known default proof systems can be naturally characterized, and prove soundness and completeness theorems for several such proof systems.
Our semantics is a "neighborhood modal semantics", and it allows for subjective defaults, that is, defaults may vary among different worlds within the same model. The semantics has an appealing intuitive interpretation and may be viewed as a set-theoretic generalization of the probabilistic interpretations of default reasoning.
We show that our semantics is most general in the sense that any modal semantics that is sound for some basic axioms for default reasoning is a special case of our semantics. Such a generality result may serve to provide a semantical analysis of the relative strength of different proof systems and to show the nonexistence of semantics with certain properties.
๐ SIMILAR VOLUMES
Of all the possible ways of computing abductive explanations, the ATMS procedure is one of the most popular. While this procedure is known to run in exponential time in the worst case, the proof actually depends on the existence of queries with an exponential number of answers. But how much of the d