Coalitions of Arguments: A Tool for Handling Bipolar Argumentation Frameworks

被引:45
作者
Cayrol, Claudette [1 ]
Lagasquie-Schiex, Marie-Christine [1 ]
机构
[1] Univ Toulouse 3, IRIT, UPS, F-31062 Toulouse 09, France
关键词
LOGIC; ACCEPTABILITY;
D O I
10.1002/int.20389
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Bipolar argumentation frameworks enable to represent two kinds of interaction between arguments: support and conflict. In this paper, we turn a bipolar argumentation framework into a meta-argumentation framework where conflicts occur between sets of arguments, characterized as coalitions of supporting arguments. So, Dung's well-known semantics can be used on this meta-argumentation framework to select the acceptable arguments. (C) 2009 Wiley Periodicals, Inc.
引用
收藏
页码:83 / 109
页数:27
相关论文
共 19 条
[1]  
Amgoud L, 2000, FRONT ARTIF INTEL AP, V54, P338
[2]  
AMGOUD L, 2004, P 10 INT WORKSH NONM, P1
[3]  
Amgoud L., 2005, P 4 INT JOINT C AUT, P1185, DOI [10.1145/1082473.1082685, DOI 10.1145/1082473.1082685]
[4]   Collective argumentation and disjunctive logic programming [J].
Bochman, A .
JOURNAL OF LOGIC AND COMPUTATION, 2003, 13 (03) :405-428
[5]  
Cayrol C, 2005, LECT NOTES COMPUT SC, V3571, P378
[6]  
Cayrol C, 2005, LECT NOTES COMPUT SC, V3571, P366
[7]  
Claude B, 1973, Graphs and hypergraphs
[8]  
DANG VD, 2004, P 3 INT JOINT C AUT, P564
[9]  
DOUTRE S, 2001, LECT NOTES ARTIF INT, V2083, P272
[10]   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