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