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
来源
PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021 | 2021年
关键词
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] A Ranking Semantics for Abstract Argumentation Based on Serialisability
    Blumel, Lydia
    Thimm, Matthias
    COMPUTATIONAL MODELS OF ARGUMENT, COMMA 2022, 2022, 353 : 104 - 115
  • [2] Argument, I Choose You! Preferences and Ranking Semantics in Abstract Argumentation
    Mailly, Jean-Guy
    Rossit, Julien
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 647 - 651
  • [3] Efficiently computing extensions' probabilities over probabilistic Bipolar Abstract Argumentation Frameworks
    Fazzinga, Bettina
    Flesca, Sergio
    Furfaro, Filippo
    Scala, Francesco
    INTELLIGENZA ARTIFICIALE, 2019, 13 (02) : 189 - 200
  • [4] Support in Abstract Argumentation
    Boella, G.
    Gabbay, D. M.
    van der Torre, L.
    Villata, S.
    COMPUTATIONAL MODELS OF ARGUMENT: PROCEEDINGS OF COMMA 2010, 2010, 216 : 111 - 122
  • [5] A logic of argumentation for specification and verification of abstract argumentation frameworks
    Villata, Serena
    Boella, Guido
    Gabbay, Dov M.
    van der Torre, Leendert
    Hulstijn, Joris
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2012, 66 (1-4) : 199 - 230
  • [6] Graded labellings for abstract argumentation
    Tan, Lixing
    Zhu, Zhaohui
    Wang, Fujun
    Zhang, Jinjin
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2023, 152 : 59 - 93
  • [7] Preferences and Constraints in Abstract Argumentation
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    Trubitsyna, Irina
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 3095 - 3103
  • [8] Change in Abstract Bipolar Argumentation Systems
    Cayrol, Claudette
    Lagasquie-Schiex, Marie-Christine
    SCALABLE UNCERTAINTY MANAGEMENT (SUM 2015), 2015, 9310 : 314 - 329
  • [9] A Labeled Abstract Bipolar Argumentation Framework
    David Budan, Maximiliano Celmo
    Viglizzo, Ignacio
    Ricardo Simari, Guillermo
    ADVANCES IN ARTIFICIAL INTELLIGENCE (IBERAMIA 2014), 2014, 8864 : 28 - 40
  • [10] Similarity notions in bipolar abstract argumentation
    Daniela Budan, Paola
    Escauela Gonzalez, Melisa Gisselle
    David Budan, Maximiliano Celmo
    Vanina Martinez, Maria
    Ricardo Simari, Guillermo
    ARGUMENT & COMPUTATION, 2020, 11 (1-2) : 103 - 149