Compact Argumentation Frameworks

被引：23

作者：

Baumann, Ringo ^{[1
]}

Dvorak, Wolfgang ^{[2
]}

Linsbichler, Thomas ^{[3
]}

Strass, Hannes ^{[1
]}

Woltran, Stefan ^{[3
]}

机构：

[1] Univ Leipzig, D-04109 Leipzig, Germany

[2] Univ Vienna, Fac Comp Sci, Vienna, Austria

[3] Vienna Univ Technol, Vienna, Austria

来源：

21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014) | 2014年 / 263卷

关键词：

D O I：

10.3233/978-1-61499-419-0-69

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A Abstract argumentation frameworks (AFs) are one of the most studied formalisms in AI. In this work, we introduce a certain subclass of AFs which we call compact. Given an extension-based semantics, the corresponding compact AFs are characterized by the feature that each argument of the AF occurs in at least one extension. This not only guarantees a certain notion of fairness; compact AFs are thus also minimal in the sense that no argument can be removed without changing the outcome. We address the following questions in the paper: (1) How are the classes of compact AFs related for different semantics? (2) Under which circumstances can AFs be transformed into equivalent compact ones? (3) Finally, we show that compact AFs are indeed a non-trivial subclass, since the verification problem remains coNP-hard for certain semantics.

引用

页码：69 / +

页数：2

共 18 条

[11]

Dunne PE, 2014, FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, P72

[12]

Dunne Paul E., 2013, P DKB, P16

[13] Coherence in finite argument systems [J].