On the evaluation of argumentation formalisms

被引:331
作者
Caminada, Martin
Amgoud, Leila
机构
[1] Inst Rech & Informat Toulouse, F-31062 Toulouse 9, France
[2] Univ Utrecht, Inst Comp & Informat Sci, Utrecht, Netherlands
关键词
formal argumentation; nonmonotonic logic; commonsense reasoning;
D O I
10.1016/j.artint.2007.02.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Argumentation theory has become an important topic in the field of AL The basic idea is to construct arguments in favor and against a statement, to select the "acceptable" ones and, finally, to determine whether the original statement can be accepted or not. Several argumentation systems have been proposed in the literature. Some of them, the so-called rule-based systems, use a particular logical language with strict and defeasible rules. While these systems are useful in different domains (e.g. legal reasoning), they unfortunately lead to very unintuitive results, as is discussed in this paper. In. order to avoid such anomalies, in this paper we are interested in defining principles, called rationality postulates, that can be used to judge the quality of a rule-based argumentation system. In particular, we define two important rationality postulates that should be satisfied: the consistency and the closure of the results returned by that system. We then provide a relatively easy way in which these rationality postulates can be warranted for a particular rule-based argumentation system developed within a European project on argumentation. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:286 / 310
页数:25
相关论文
共 46 条
[1]  
Alferes J. J., 1993, P 2 INT WORKSH LOG P, P334
[2]   Inferring from inconsistency in preference-based argumentation frameworks [J].
Amgoud, L ;
Cayrol, C .
JOURNAL OF AUTOMATED REASONING, 2002, 29 (02) :125-169
[3]   A reasoning model based on the production of acceptable arguments [J].
Amgoud, L ;
Cayrol, C .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2002, 34 (1-3) :197-215
[4]  
Amgoud L, 2000, FRONT ARTIF INTEL AP, V54, P338
[5]  
AMGOUD L., 2004, CONSENSUAL FORMAL MO
[6]  
AMGOUD L, 2005, P 4 INT JOINT C AUT, P537
[7]  
AMGOUD L, 2002, P EUR C LOG ART INT, P27
[8]  
AMGOUD L, 2005, 8 EUR C SYMB QUANT A, P527
[9]  
AMGOUD L, 2005, P 21 C UNC ART INT, P26
[10]  
Amgoud L., 2004, P 9 INT C PRINC KNOW, P175