SCC-recursiveness: a general schema for argumentation semantics

被引:196
|
作者
Baroni, P [1 ]
Giacomin, M [1 ]
Guida, G [1 ]
机构
[1] Univ Brescia, Dipartimento Elettron & Automaz, I-25123 Brescia, Italy
关键词
argumentation semantics; extensions; defeat cycles;
D O I
10.1016/j.artint.2005.05.006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In argumentation theory, Dung's abstract framework provides a unifying view of several alternative semantics based on the notion of extension. In this context, we propose a general recursive schema for argumentation semantics, based on decomposition along the strongly connected components of the argumentation framework. We introduce the fundamental notion of SCC-recursiveness and we show that all Dung's admissibility-based semantics are SCC-recursive, and therefore a special case of our schema. On these grounds, we argue that the concept of SCC-recursiveness plays a fundamental role in the study and definition of argumentation semantics. In particular, the space of SCC-recursive semantics provides an ideal basis for the investigation of new proposals: starting from the analysis of several examples where Dung's preferred semantics gives rise to questionable results, we introduce four novel SCC-recursive semantics, able to overcome the limitations of preferred semantics, while differing in other respects. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:162 / 210
页数:49
相关论文
共 50 条
  • [21] Forbidden Sets in Argumentation Semantics
    Dunne, Paul E.
    COMPUTATIONAL MODELS OF ARGUMENT, 2016, 287 : 275 - 286
  • [22] DECOMPOSING SEMANTICS IN ABSTRACT ARGUMENTATION
    Baroni, Pietro
    Cerutti, Federico
    Giacomin, Massimiliano
    JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 2023, 10 (03):
  • [23] Comparing the Expressiveness of Argumentation Semantics
    Dvorak, Wolfgang
    Spanring, Christof
    COMPUTATIONAL MODELS OF ARGUMENT, 2012, 245 : 261 - +
  • [24] Serialisable Semantics for Abstract Argumentation
    Bengel, Lars
    Thimm, Matthias
    COMPUTATIONAL MODELS OF ARGUMENT, COMMA 2022, 2022, 353 : 80 - 91
  • [25] Prudent semantics for argumentation frameworks
    Coste-Marquis, S
    Devred, C
    Marquis, P
    ICTAI 2005: 17TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2005, : 568 - 572
  • [26] A Replication Study of Semantics in Argumentation
    Amgoud, Leila
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 6260 - 6266
  • [27] On the Functional Completeness of Argumentation Semantics
    Giacomin, Massimiliano
    Linsbichler, Thomas
    Woltran, Stefan
    FIFTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2016, : 43 - 52
  • [28] ARGUMENTATION AND THE SEMANTICS OF POSSIBLE WORLDS
    MARTIN, R
    REVUE INTERNATIONALE DE PHILOSOPHIE, 1985, 39 (155) : 302 - 321
  • [29] Decomposing Semantics in Abstract Argumentation
    Baroni, Pietro
    Cerutti, Federico
    Giacomin, Massimiliano
    Journal of Applied Logics, 2023, 10 (03): : 341 - 392
  • [30] Robust semantics for argumentation frameworks
    Jakobovits, H
    Vermeir, D
    JOURNAL OF LOGIC AND COMPUTATION, 1999, 9 (02) : 215 - 261