Default reasoning is computationally expensive. One of the most promising ways of easing this problem and developing powerful implementations is to split a default theory into smaller parts and compute extensions in a modular, ''local'' way. Up to now this idea was only followed for Reiter's default
Alternative foundations for Reiter's default logic
โ Scribed by Thomas Linke; Torsten Schaub
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 443 KB
- Volume
- 124
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
โฆ Synopsis
We introduce an alternative conceptual basis for default reasoning in Reiter's default logic. In fact, most formal or computational treatments of default logic suffer from the necessity of exhaustive consistency checks with respect to the finally resulting set of conclusions; often this so-called extension is just about being constructed. On the theoretical side, this exhaustive approach is reflected by the usual fixed-point characterizations of extensions. Our goal is to reduce such global considerations to local and strictly necessary ones. For this purpose, we develop various techniques and instruments that draw on an analysis of interaction patterns between default rules, embodied by their mutual blocking behavior. These formal tools provide us with alternative means for addressing a variety of questions in default logic. We demonstrate the utility of our approach by applying it to three traditional problems. First, we obtain a range of criteria guaranteeing the existence and non-existence of extensions. Second, we get alternative characterizations of extensions that avoid fixed-point conditions. Finally, we furnish a formal account of default proofs that was up to now neglected in the literature.
๐ SIMILAR VOLUMES
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 prese
This paper presents an abstract treatment of the foundations of rewriting logic, generalising in three ways: an arbitrary 2-category plays the role of the specific 2-category Cat; the foundations are rendered fully independent of the underlying equational logic; and the semantics covers non-conventi