Skepticism relations for comparing argumentation semantics

被引:21
作者
Baroni, Pietro [1 ]
Giacomin, Massimiliano [1 ]
机构
[1] Univ Brescia, Dipartimento Elettron Automaz, I-25123 Brescia, Italy
关键词
Argumentation theory; Argumentation semantics; Skepticism relations;
D O I
10.1016/j.ijar.2009.02.006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The issue of formalizing skepticism relations between argumentation semantics has been considered only recently in the literature. In this paper we provide a twofold contribution to this kind of analysis. First, starting from the traditional concepts of skeptical and credulous acceptance, we introduce a comprehensive set of seven skepticism relations, which provide a formal Counterpart to several alternative notions of skepticism at an intuitive level. Then we carry out a systematic comparison of a significant set of literature semantics (namely grounded, complete, preferred, stable, semi-stable, ideal. prudent and CF2 sennantics) on the basis of the proposed skepticism relations. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:854 / 866
页数:13
相关论文
共 26 条
[1]   SCC-recursiveness: a general schema for argumentation semantics [J].
Baroni, P ;
Giacomin, M ;
Guida, G .
ARTIFICIAL INTELLIGENCE, 2005, 168 (1-2) :162-210
[2]  
Baroni P, 2003, LECT NOTES ARTIF INT, V2711, P440
[3]  
Baroni P., 2004, PROC 4THWORKSHOP COM, P4752
[4]  
BARONI P, 2005, P 8 EUR C SYMB QUANT, P329
[5]  
BARONI P, 2006, P 1 INT C COMP MOD A, P157
[6]  
Baroni P, 2007, LECT NOTES ARTIF INT, V4724, P210
[7]   On principle-based evaluation of extension-based argumentation semantics [J].
Baroni, Pietro ;
Giacomin, Massimiliano .
ARTIFICIAL INTELLIGENCE, 2007, 171 (10-15) :675-700
[8]   An abstract, argumentation-theoretic approach to default reasoning [J].
Bondarenko, A ;
Dung, PM ;
Kowalski, RA ;
Toni, F .
ARTIFICIAL INTELLIGENCE, 1997, 93 (1-2) :63-101
[9]  
Caminada M., 2005, P 20 NATL C ARTIFICI, P608
[10]  
Caminada M, 2006, FR ART INT, V144, P121