Some Supplementaries to The Counting Semantics for Abstract Argumentation

被引:4
作者
Pu, Fuan [1 ]
Luo, Jian [1 ]
Luo, Guiming [1 ]
机构
[1] Tsinghua Univ, Sch Software, Beijing 100084, Peoples R China
来源
2015 IEEE 27TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2015) | 2015年
关键词
abstract argumentation; argument game; graded assessment; counting semantics; ranking-based semantics; FRAMEWORKS;
D O I
10.1109/ICTAI.2015.46
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dung's abstract argumentation framework consists of a set of interacting arguments and a series of semantics for evaluating them. Those semantics partition the powerset of the set of arguments into two classes: extensions and nonextensions. In order to reason with a specific semantics, one needs to take a credulous or skeptical approach, i.e. an argument is eventually accepted, if it is accepted in one or all extensions, respectively. In our previous work [1], we have proposed a novel semantics, called counting semantics, which allows for a more fine-grained assessment to arguments by counting the number of their respective attackers and defenders based on argument graph and argument game. In this paper, we continue our previous work by presenting some supplementaries about how to choose the damaging factor for the counting semantics, and what relationships with some existing approaches, such as Dung's classical semantics, generic gradual valuations. Lastly, an axiomatic perspective on the ranking semantics induced by our counting semantics are presented.
引用
收藏
页码:242 / 249
页数:8
相关论文
共 17 条
[1]  
Amgoud L., 1998, Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, P1
[2]  
Amgoud L, 2013, LECT NOTES ARTIF INT, V8078, P134, DOI 10.1007/978-3-642-40381-1_11
[3]  
[Anonymous], 2012, Matrix Analysis
[4]   A logic-based theory of deductive arguments [J].
Besnard, P ;
Hunter, A .
ARTIFICIAL INTELLIGENCE, 2001, 128 (1-2) :203-235
[5]  
Caminada M., 2009, LOG J IGPL
[6]   On the issue of reinstatement in argumentation [J].
Caminada, Martin .
LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4160 :111-123
[7]  
Cayrol C, 2005, LECT NOTES COMPUT SC, V3571, P366
[8]   Graduality in argumentation [J].
Cayrol, C ;
Lagasquie-Schiex, MC .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2005, 23 :245-297
[9]  
David D. C., 2000, KNOWL ENG REV, V15, P2000
[10]  
DUNG PM, 1995, J ARTIFICIAL INTELLI, V77, P321