Inferring from inconsistency in preference-based argumentation frameworks

被引:136
作者
Amgoud, L [1 ]
Cayrol, C [1 ]
机构
[1] Univ Toulouse 3, Inst Rech Informat Toulouse, F-31062 Toulouse, France
关键词
handling inconsistency; argumentation; preference relations;
D O I
10.1023/A:1021603608656
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Argumentation is a promising approach to handle inconsistent knowledge bases, based on the justification of plausible conclusions by arguments. Because of inconsistency, however, arguments may be defeated by counterarguments (or defeaters). The problem is thus to select the most acceptable arguments. In this paper we investigate preference-based acceptability. The basic idea is to accept undefeated arguments and also arguments that are preferred to their defeaters. We say that these arguments defend themselves against their defeaters. We define argumentation frameworks based on that preference-based acceptability. Finally, we study associated inference relations for reasoning with inconsistent knowledge bases.
引用
收藏
页码:125 / 169
页数:45
相关论文
共 35 条
[1]   Comparing arguments using preference orderings for argument-based reasoning [J].
Amgoud, L ;
Cayrol, C ;
LeBerre, D .
EIGHTH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1996, :400-403
[2]  
Amgoud L., 1997, P ECSQARU FAPR 97, P159
[3]  
AMGOUD L, 2002, IN PRESS ANN MATH AR
[4]  
[Anonymous], 1958, USES ARGUMENTS
[5]  
BENFERHAT S, 1995, P 14 INT JOINT C ART, P1449
[6]  
BENFERHAT S, 1993, P 9 C UNC ART INT, P411
[7]  
BIBEL W, 1985, LECT NOTES COMPUT SC, V232
[8]  
BREWKA G, 1994, PROCEEDINGS OF THE TWELFTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, P940
[9]  
BREWKA G, 1989, P 11 INT JOINT C ART, P1043
[10]  
CAYROL C, 1995, P EUR C SYMB QUANT A, P99