On Deciding Admissibility in Abstract Argumentation Frameworks

被引：0
作者：
Nofal, Samer [1 ]
Atkinson, Katie [2 ]
Dunne, Paul E. [2 ]
机构：
[1] German Jordanian Univ, Dept Comp Sci, Amman, Jordan
[2] Univ Liverpool, Dept Comp Sci, Liverpool, Merseyside, England
来源：
KEOD: PROCEEDINGS OF THE 11TH INTERNATIONAL JOINT CONFERENCE ON KNOWLEDGE DISCOVERY, KNOWLEDGE ENGINEERING AND KNOWLEDGE MANAGEMENT - VOL 2: KEOD | 2019年
关键词：
Argument-based Knowledge Base; Argument-based Reasoning; Computational Argumentation; Algorithms; DECISION-PROBLEMS; ALGORITHMS; SYSTEMS; INCONSISTENCY;
D O I：
10.5220/0008064300670075
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In the context of abstract argumentation frameworks, the admissibility problem is about deciding whether a given argument (i.e. piece of knowledge) is admissible in a conflicting knowledge base. In this paper we present an enhanced backtracking-based algorithm for solving the admissibility problem. The algorithm performs successfully when applied to a wide range of benchmark abstract argumentation frameworks and when compared to the state-of-the-art algorithm.
引用
收藏
页码：67 / 75
页数：9
相关论文
共 50 条
  • [31] Assessment of benchmarks for abstract argumentation
    Mailly, Jean-Guy
    Maratea, Marco
    ARGUMENT & COMPUTATION, 2019, 10 (02) : 107 - 112
  • [32] Probabilities on Extensions in Abstract Argumentation
    Thimm, Matthias
    Baroni, Pietro
    Giacomin, Massimiliano
    Vicig, Paolo
    THEORY AND APPLICATIONS OF FORMAL ARGUMENTATION, TAFA 2017, 2018, 10757 : 102 - 119
  • [33] On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
    Schulz, Claudia
    Toni, Francesca
    ARTIFICIAL INTELLIGENCE, 2018, 262 : 301 - 335
  • [34] TOWARDS AVERAGE-CASE ALGORITHMS FOR ABSTRACT ARGUMENTATION
    Nofal, Samer
    Dunne, Paul
    Atkinson, Katie
    ICAART: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2012, : 225 - 230
  • [35] Heureka: A General Heuristic Backtracking Solver for Abstract Argumentation
    Geilen, Nils
    Thimm, Matthias
    THEORY AND APPLICATIONS OF FORMAL ARGUMENTATION, TAFA 2017, 2018, 10757 : 143 - 149
  • [36] 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
  • [37] Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive
    Bistarelli, Stefano
    Rossi, Fabio
    Santini, Francesco
    JOURNAL OF LOGIC AND COMPUTATION, 2018, 28 (01) : 85 - 117
  • [38] Argumentation Frameworks with Strong and Weak Constraints: Semantics and Complexity
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    Trubitsyna, Irina
    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 : 6175 - 6184
  • [39] The complexity landscape of claim-augmented argumentation frameworks
    Dvorak, Wolfgang
    Gressler, Alexander
    Rapberger, Anna
    Woltran, Stefan
    ARTIFICIAL INTELLIGENCE, 2023, 317
  • [40] An Epistemic Interpretation of Abstract Dialectical Argumentation
    Heyninck, Jesse
    Kern-Isberner, Gabriele
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020), 2020, 326 : 227 - 238
12345