SCC-recursiveness: a general schema for argumentation semantics

被引:196
作者
Baroni, P [1 ]
Giacomin, M [1 ]
Guida, G [1 ]
机构
[1] Univ Brescia, Dipartimento Elettron & Automaz, I-25123 Brescia, Italy
关键词
argumentation semantics; extensions; defeat cycles;
D O I
10.1016/j.artint.2005.05.006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In argumentation theory, Dung's abstract framework provides a unifying view of several alternative semantics based on the notion of extension. In this context, we propose a general recursive schema for argumentation semantics, based on decomposition along the strongly connected components of the argumentation framework. We introduce the fundamental notion of SCC-recursiveness and we show that all Dung's admissibility-based semantics are SCC-recursive, and therefore a special case of our schema. On these grounds, we argue that the concept of SCC-recursiveness plays a fundamental role in the study and definition of argumentation semantics. In particular, the space of SCC-recursive semantics provides an ideal basis for the investigation of new proposals: starting from the analysis of several examples where Dung's preferred semantics gives rise to questionable results, we introduce four novel SCC-recursive semantics, able to overcome the limitations of preferred semantics, while differing in other respects. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:162 / 210
页数:49
相关论文
共 27 条
[1]   Inferring from inconsistency in preference-based argumentation frameworks [J].
Amgoud, L ;
Cayrol, C .
JOURNAL OF AUTOMATED REASONING, 2002, 29 (02) :125-169
[2]   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
[3]  
Amgoud L, 2000, FRONT ARTIF INTEL AP, V54, P338
[4]  
Baroja Pio, 1901, PAIS, P1
[5]   Extending abstract argumentation systems theory [J].
Baroni, P ;
Giacomin, M ;
Guida, G .
ARTIFICIAL INTELLIGENCE, 2000, 120 (02) :251-270
[6]  
Baroni P, 2003, LECT NOTES ARTIF INT, V2711, P440
[7]  
BARONI P, 2004, P 10 INT WORKSH NONM, P50
[8]  
Baroni P, 2004, PROC 4THWORKSHOP COM, P47
[9]   ON THE ACCEPTABILITY OF ARGUMENTS AND ITS FUNDAMENTAL ROLE IN NONMONOTONIC REASONING, LOGIC PROGRAMMING AND N-PERSON GAMES [J].
DUNG, PM .
ARTIFICIAL INTELLIGENCE, 1995, 77 (02) :321-357
[10]   Defeasible logic programming:: an argumentative approach [J].
García, AJ ;
Simari, GR .
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2004, 4 :95-138