Ranking Extensions in Abstract Argumentation

被引:0
|
作者
Skiba, Kenneth [1 ]
Rienstra, Tjitze [1 ]
Thimm, Matthias [1 ]
Heyninck, Jesse [2 ]
Kern-Isberner, Gabriele [2 ]
机构
[1] Univ Koblenz Landau, Koblenz, Germany
[2] TU Dortmund, Dortmund, Germany
关键词
ACCEPTABILITY;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Extension-based semantics in abstract argumentation provide a criterion to determine whether a set of arguments is acceptable or not. In this paper, we present the notion of extension-ranking semantics, which determines a preordering over sets of arguments, where one set is deemed more plausible than another if it is somehow more acceptable. We obtain extension-based semantics as a special case of this new approach, but it also allows us to make more fine-grained distinctions, such as one set being "more complete" or "more admissible" than another. We define a number of general principles to classify extension-ranking semantics and develop concrete approaches. We also study the relation between extension-ranking semantics and argument-ranking semantics, which rank individual arguments instead of sets of arguments.
引用
收藏
页码:2047 / 2053
页数:7
相关论文
共 50 条
  • [1] Probabilities on Extensions in Abstract Argumentation
    Thimm, Matthias
    Baroni, Pietro
    Giacomin, Massimiliano
    Vicig, Paolo
    THEORY AND APPLICATIONS OF FORMAL ARGUMENTATION, TAFA 2017, 2018, 10757 : 102 - 119
  • [2] A Ranking Semantics for Abstract Argumentation Based on Serialisability
    Blumel, Lydia
    Thimm, Matthias
    COMPUTATIONAL MODELS OF ARGUMENT, COMMA 2022, 2022, 353 : 104 - 115
  • [3] On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks
    Kroell, Markus
    Pichler, Reinhard
    Woltran, Stefan
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 1145 - 1152
  • [4] A Comparative Test on the Enumeration of Extensions in Abstract Argumentation
    Bistarelli, Stefano
    Rossi, Fabio
    Santini, Francesco
    FUNDAMENTA INFORMATICAE, 2015, 140 (3-4) : 263 - 278
  • [5] Computing Grounded Extensions Of Abstract Argumentation Frameworks
    Nofal, Samer
    Atkinson, Katie
    Dunne, Paul E.
    COMPUTER JOURNAL, 2021, 64 (01): : 54 - 63
  • [6] Efficiently Estimating the Probability of Extensions in Abstract Argumentation
    Fazzinga, Bettina
    Flesca, Sergio
    Parisi, Francesco
    SCALABLE UNCERTAINTY MANAGEMENT, SUM 2013, 2013, 8078 : 106 - 119
  • [7] A tool for merging extensions of abstract argumentation frameworks
    Delobelle, Jerome
    Mailly, Jean-Guy
    ARGUMENT & COMPUTATION, 2022, 13 (03) : 361 - 368
  • [8] On Scaling the Enumeration of the Preferred Extensions of Abstract Argumentation Frameworks
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 1147 - 1153
  • [9] On efficiently estimating the probability of extensions in abstract argumentation frameworks
    Fazzinga, Bettina
    Flesca, Sergio
    Parisi, Francesco
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2016, 69 : 106 - 132
  • [10] Efficient Computation of Deterministic Extensions for Dynamic Abstract Argumentation Frameworks
    Greco, Sergio
    Parisi, Francesco
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1668 - 1669