On the resolution-based family of abstract argumentation semantics and its grounded instance

被引：31

作者：

Baroni, P. ^{[1
]}

Dunne, P. E. ^{[2
]}

Giacomin, M. ^{[1
]}

机构：

[1] Univ Brescia, Dip Ingn Informaz, I-25123 Brescia, Italy

[2] Univ Liverpool, Dept Comp Sci, Liverpool L69 7ZF, Merseyside, England

来源：

ARTIFICIAL INTELLIGENCE | 2011年 / 175卷 / 3-4期

关键词：

Abstract argumentation semantics; Argumentation framework; Grounded semantics; Semantics evaluation criteria; Computational complexity;

D O I：

10.1016/j.artint.2010.11.005

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper introduces a novel parametric family of semantics for abstract argumentation called resolution-based and analyzes in particular the resolution-based version of the traditional grounded semantics, showing that it features the unique property of satisfying a set of general desirable properties recently introduced in the literature. Additionally, an investigation of its computational complexity properties reveals that resolution-based grounded semantics is satisfactory also from this perspective. (C) 2010 Elsevier B.V. All rights reserved.

引用

页码：791 / 813

页数：23

共 32 条

[1]

Abramsky Samson, 1995, Handbook of Logic in Computer Science, VIII, P1

[2] A reasoning model based on the production of acceptable arguments [J].

Amgoud, L ;

Cayrol, C .

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2002, 34 (1-3) :197-215

[3]

Baroni P, 2005, LECT NOTES COMPUT SC, V3571, P329

[4] SCC-recursiveness: a general schema for argumentation semantics [J].

Baroni, P ;

Giacomin, M ;

Guida, G .

ARTIFICIAL INTELLIGENCE, 2005, 168 (1-2) :162-210

[5]

Baroni P., 2004, PROC 4THWORKSHOP COM, P4752

[6] On principle-based evaluation of extension-based argumentation semantics [J].

Baroni, Pietro ;

Giacomin, Massimiliano .

ARTIFICIAL INTELLIGENCE, 2007, 171 (10-15) :675-700

[7] AFRA: Argumentation framework with recursive attacks [J].

Baroni, Pietro ;

Cerutti, Federico ;

Giacomin, Massimiliano ;

Guida, Giovanni .

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2011, 52 (01) :19-37

[8]

Baroni P, 2009, ARGUMENTATION IN ARTIFICIAL INTELLIGENCE, P25, DOI 10.1007/978-0-387-98197-0_2

[9]

Baroni P, 2009, LECT NOTES COMPUT SC, V5590, P83, DOI 10.1007/978-3-642-02906-6_9

[10] Skepticism relations for comparing argumentation semantics [J].

Baroni, Pietro ;

Giacomin, Massimiliano .

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2009, 50 (06) :854-866

← 1 2 3 4 →