A Ranking Semantics for Abstract Argumentation Based on Serialisability

被引：0
|
作者：
Blumel, Lydia [1 ]
Thimm, Matthias [1 ]
机构：
[1] Univ Hagen, Artificial Intelligence Grp, Hagen, Germany
来源：
COMPUTATIONAL MODELS OF ARGUMENT, COMMA 2022 | 2022年 / 353卷
关键词：
abstract argumentation; ranking semantics; serialisability; ACCEPTABILITY;
D O I：
10.3233/FAIA220145
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We revisit the foundations of ranking semantics for abstract argumentation frameworks by observing that most existing approaches are incompatible with classical extension-based semantics. In particular, most ranking semantics violate the principle of admissibility, meaning that admissible arguments are not necessarily better ranked than inadmissible arguments. We propose new postulates for capturing said compatibility with classical extension-based semantics and present a new ranking semantics that complies with these postulates. This ranking semantics is based on the recently proposed notion of serialisability that allows to rank arguments according to the number of conflicts needed to be solved in order to include that argument in an admissible set.
引用
收藏
页码：104 / 115
页数：12
相关论文
共 50 条
  • [31] Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility
    Dvorak, Wolfgang
    Ulbricht, Markus
    Woltran, Stefan
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2022, 74 : 1403 - 1447
  • [32] Recursion in Abstract Argumentation is Hard — On the Complexity of Semantics Based on Weak Admissibility
    Dvořák W.
    Ulbricht M.
    Woltran S.
    Journal of Artificial Intelligence Research, 2022, 74 : 1403 - 1447
  • [33] Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility
    Dvorak, Wolfgang
    Ulbricht, Markus
    Woltran, Stefan
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 6288 - 6295
  • [34] Focusing the Argumentative Process: Neighborhood-Based Semantics in Abstract Argumentation
    Escanuela Gonzalez, Melisa G.
    Budan, Maximiliano C. D.
    Martinez, Diego, I
    Laura Cobo, Maria
    Simari, Guillermo R.
    LOGIC AND ARGUMENTATION, CLAR 2021, 2021, 13040 : 20 - 39
  • [35] On the resolution-based family of abstract argumentation semantics and its grounded instance
    Baroni, P.
    Dunne, P. E.
    Giacomin, M.
    ARTIFICIAL INTELLIGENCE, 2011, 175 (3-4) : 791 - 813
  • [36] Revisiting the Foundations of Abstract Argumentation - Semantics Based on Weak Admissibility and Weak Defense
    Baumann, Ringo
    Brewka, Gerhard
    Ulbricht, Markus
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 2742 - 2749
  • [37] Extension Enforcement under Grounded Semantics in Abstract Argumentation
    Niskanen, Andreas
    Wallner, Johannes P.
    Jarvisalo, Matti
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 178 - 182
  • [38] Optimisation and Approximation in Abstract Argumentation: The Case of Stable Semantics
    Thimm, Matthias
    PROCEEDINGS OF THE THIRTY-THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2024, 2024, : 3576 - 3583
  • [39] Behavioral Experiments for Assessing the Abstract Argumentation Semantics of Reinstatement
    Rahwan, Iyad
    Madakkatel, Mohammed I.
    Bonnefon, Jean-Francois
    Awan, Ruqiyabi N.
    Abdallah, Sherief
    COGNITIVE SCIENCE, 2010, 34 (08) : 1483 - 1502
  • [40] On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    Trubitsyna, Irina
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2020, 20 (05) : 703 - 718
12345