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 条
  • [21] Indepth combinatorial analysis of admissible sets for abstract argumentation
    Cosmina Croitoru
    Madalina Croitoru
    Annals of Mathematics and Artificial Intelligence, 2022, 90 : 1139 - 1158
  • [22] Proximity semantics for topic-based abstract argumentation
    Budan, Maximiliano C. D.
    Laura Cobo, Maria
    Martinez, Diego C.
    Simari, Guillermo R.
    INFORMATION SCIENCES, 2020, 508 (135-153) : 135 - 153
  • [23] Indepth combinatorial analysis of admissible sets for abstract argumentation
    Croitoru, Cosmina
    Croitoru, Madalina
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2022, 90 (11-12) : 1139 - 1158
  • [24] Methods for solving reasoning problems in abstract argumentation - A survey
    Charwat, Guenther
    Dvorak, Wolfgang
    Gaggl, Sarah A.
    Wallner, Johannes P.
    Woltran, Stefan
    ARTIFICIAL INTELLIGENCE, 2015, 220 : 28 - 63
  • [25] A formalization of abstract argumentation in higher-order logic
    Steen, Alexander
    Fuenmayor, David
    JOURNAL OF LOGIC AND COMPUTATION, 2024, 34 (02) : 229 - 260
  • [26] Guaranteeing admissibility of abstract argumentation frameworks with rationality and feasibility constraints
    Chen, Weiwei
    JOURNAL OF LOGIC AND COMPUTATION, 2021, 31 (08) : 2133 - 2158
  • [27] Credulous and skeptical acceptability in probabilistic abstract argumentation: complexity results
    Fazzinga, Bettina
    Flesca, Sergio
    Furfaro, Filippo
    INTELLIGENZA ARTIFICIALE, 2018, 12 (02) : 181 - 191
  • [28] Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation
    Thang, Phan Minh
    Dung, Phan Minh
    Hung, Nguyen Duy
    JOURNAL OF LOGIC AND COMPUTATION, 2009, 19 (06) : 1071 - 1109
  • [29] An extension-based approach to belief revision in abstract argumentation
    Diller, Martin
    Haret, Adrian
    Linsbichler, Thomas
    Ruemmele, Stefan
    Woltran, Stefan
    INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2018, 93 : 395 - 423
  • [30] Dynamics in Abstract Argumentation Frameworks with Recursive Attack and Support Relations
    Alfano, Gianvincenzo
    Cohen, Andrea
    Gottifredi, Sebastian
    Greco, Sergio
    Parisi, Francesco
    Ricardo, Guillermo
    ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 577 - 584