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 条
  • [31] A general approach to extension-based semantics in abstract argumentation
    Tan, Lixing
    Zhu, Zhaohui
    Zhang, Jinjin
    ARTIFICIAL INTELLIGENCE, 2023, 315
  • [32] Defining the Semantics of Abstract Argumentation Frameworks through Logic Programs and Partial Stable Models (Extended Abstract)
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    Trubitsyna, Irina
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 4735 - 4739
  • [33] A propagation-based ranking semantics in Explainable Bipolar Weighted Argumentation
    Fasciano, Corrado
    Loseto, Giuseppe
    Pinto, Agnese
    Ruta, Michele
    Scioscia, Floriano
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2025, 142
  • [34] A Similarity-Based Abstract Argumentation Approach to Extractive Text Summarization
    Ferilli, Stefano
    Pazienza, Andrea
    Angelastro, Sergio
    Suglia, Alessandro
    AI*IA 2017 ADVANCES IN ARTIFICIAL INTELLIGENCE, 2017, 10640 : 87 - 100
  • [35] Reduced meet over labelling-based semantics in abstract argumentation
    Tan, Lixing
    Zhu, Zhaohui
    Zhang, Jinjin
    INFORMATION PROCESSING LETTERS, 2025, 187
  • [36] An Abstract Argumentation-Based Approach to Automatic Extractive Text Summarization
    Ferilli, Stefano
    Pazienza, Andrea
    DIGITAL LIBRARIES AND MULTIMEDIA ARCHIVES, IRCDL 2018, 2018, 806 : 57 - 68
  • [37] HIGHER-ORDER INTERACTIONS (BIPOLAR OR NOT) IN ABSTRACT ARGUMENTATION: A STATE OF THE ART
    Cayrol, Claudette
    Cohen, Andrea
    Lagasquie-Schiex, Marie-Christine
    JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 2021, 8 (06): : 1339 - 1435
  • [38] Empirical evaluation of abstract argumentation: Supporting the need for bipolar and probabilistic approaches
    Polberg, Sylwia
    Hunter, Anthony
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2018, 93 : 487 - 543
  • [39] A Distributed and Clustering-Based Algorithm for the Enumeration Problem in Abstract Argumentation
    Doutre, Sylvie
    Lafages, Mickael
    Lagasquie-Schiex, Marie-Christine
    PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS (PRIMA 2019), 2019, 11873 : 87 - 105
  • [40] Abstract Games of Argumentation Strategy and Game-Theoretical Argument Strength
    Baroni, Pietro
    Comini, Giulia
    Rago, Antonio
    Toni, Francesca
    PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS (PRIMA 2017), 2017, 10621 : 403 - 419