Default reasoning with specificity

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a new approach to reasoning with specificity which subsumes inheritance reasoning1. The new approach differs from other approaches in the literature in the way priority between defaults is handled. Here, it is context sensitive rather than context independent as in other approaches. We show that any context independent handling of priorities between defaults as advocated in the literature until now is not sufficient to capture general defeasible inheritance reasoning. We propose a simple and novel argumentation semantics for reasoning with specificity taking the context-dependency of the priorities between defaults into account. Since the proposed argumentation semantics is a form of stable semantics of nonmonotonic reasoning, it inherits a common problem of the latter where it is not always defined for every default theory. We identify the class of stratified default theories which is large enough to accommodate acyclic and consistent inheritance networks and for which the argumentation semantics is always defined. We also prove that the argumentation semantics satisfies the basic properties of a nonmonotonic consequence relation such as deduction, reduction, conditioning, and cumulativity for stratified default theories.

Cite

CITATION STYLE

APA

D͡ng, P. M., & Son, T. C. (2000). Default reasoning with specificity. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 1861, pp. 792–806). Springer Verlag. https://doi.org/10.1007/3-540-44957-4_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free