ArgSemSAT: Solving Argumentation Problems Using SAT

被引:36
作者
Cerutti, Federico [1 ]
Giacomin, Massimiliano [2 ]
Vallati, Mauro [3 ]
机构
[1] Univ Aberdeen, Kings Coll, Dept Comp Sci, Aberdeen AB9 1FX, Scotland
[2] Univ Brescia, Dept Informat Engn, I-25121 Brescia, Italy
[3] Univ Huddersfield, Sch Comp & Engn, Huddersfield HD1 3DH, W Yorkshire, England
来源
COMPUTATIONAL MODELS OF ARGUMENT | 2014年 / 266卷
关键词
argumentation; argumentation semantics; extensions enumeration;
D O I
10.3233/978-1-61499-436-7-455
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we describe the system ArgSemSAT which includes algorithms which we proved to overcome current state-of-the-art performances in enumerating preferred extensions.
引用
收藏
页码:455 / 456
页数:2
相关论文
共 5 条
[1]  
Audemard G, 2012, GLUCOSE 2 1
[2]   SCC-recursiveness: a general schema for argumentation semantics [J].
Baroni, P ;
Giacomin, M ;
Guida, G .
ARTIFICIAL INTELLIGENCE, 2005, 168 (1-2) :162-210
[3]  
Biere Armin., 2009, SAT COMPETITION 2009
[4]  
Cerutti Federico, 2014, Theory and Applications of Formal Argumentation. Second International Workshop, TAFA 2013. Revised Selected papers: LNCS 8306, P176, DOI 10.1007/978-3-642-54373-9_12
[5]  
Cerutti Federico, 2014, P KR 2014