ACCUEIL

Consignes aux
auteurs
Autres revues >>
Journal of Applied Non-classical Logics
1166-3081
 

 ARTICLE VOL 13/1 - 2003  - pp.87-113  - doi:10.3166/jancl.13.87-113
TITLE
Computing Generalized Specificity

ABSTRACT
Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [POO 85, SIM 92]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i. e., preference among defeasible rules is determined dynamically during the dialectical analysis. We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rulebased formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly.


AUTEUR(S)
F.STOLZENBURG, A.GARCÍA, C.CHESÑEVAR, G.SIMARI

KEYWORDS
defeasible reasoning, knowledge representation, logic programming, non-monotonic reasoning

LANGUE DE L'ARTICLE
Anglais

 PRIX
• Abonné (hors accès direct) : 17.5 €
• Non abonné : 35.0 €
|
|
--> Tous les articles sont dans un format PDF protégé 
   
ACCÉDER A L'ARTICLE COMPLET  (165 Ko)
--> NÉCESSITE ADOBE DIGITAL EDITIONS :




ABONNEZ-VOUS !

CONTACTS
Comité de
rédaction
Conditions
générales de vente

 English version >> 
made by WAW Lavoisier