Power index-based semantics for ranking arguments in abstract argumentation frameworks

被引:3
|
作者
Bistarelli, Stefano [1 ]
Taticchi, Carlo [2 ]
机构
[1] Univ Perugia, Dept Math & Comp Sci, Perugia, Italy
[2] Gran Sasso Sci Inst, Dept Comp Sci, Laquila, Italy
关键词
Argumentation; semantics; ranking; cooperative game theory; Shapley Value; Banzhaf Index;
D O I
10.3233/IA-190031
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Ranking-based semantics for Abstract Argumentation Frameworks represent a well-established concept used for sorting a group of arguments from the most to the least acceptable. This paper describes a ranking-based semantics that makes use of power indexes such as the Shapley Value and the Banzhaf Power Index. This power index-based semantics is parametric to a chosen Dung semantics and inherits the properties of the index that is used for evaluating the arguments. We highlight the characteristics of the rankings obtained through different evaluation functions and we verify which of the properties from the literature are satisfied. Finally, we study the relation between the (skeptical/credulous) acceptability of an argument and its position in the ranking, thus designing new properties.
引用
收藏
页码:137 / 154
页数:18
相关论文
共 50 条
  • [31] Reduced meet over labelling-based semantics in abstract argumentation
    Tan, Lixing
    Zhu, Zhaohui
    Zhang, Jinjin
    INFORMATION PROCESSING LETTERS, 2025, 187
  • [32] 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
  • [33] 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
  • [34] 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
  • [35] 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
  • [36] Grounded semantics and principle-based analysis for incomplete argumentation frameworks
    Mailly, Jean-Guy
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2024, 175
  • [38] 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
  • [39] 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
  • [40] Extension-based semantics for incomplete argumentation frameworks: properties, complexity and algorithms
    Mailly, Jean-Guy
    JOURNAL OF LOGIC AND COMPUTATION, 2023, 33 (02) : 406 - 435