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 条
  • [21] Counting Complexity for Reasoning in Abstract Argumentation
    Fichte, Johannes K.
    Hecher, Markus
    Meier, Arne
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2024, 80 : 805 - 834
  • [22] Pakota: A System for Enforcement in Abstract Argumentation
    Niskanen, Andreas
    Wallner, Johannes P.
    Jarvisalo, Matti
    LOGICS IN ARTIFICIAL INTELLIGENCE, (JELIA 2016), 2016, 10021 : 385 - 400
  • [23] Revisiting SAT Techniques for Abstract Argumentation
    Klein, Jonas
    Thimm, Matthias
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020), 2020, 326 : 251 - 262
  • [24] Towards Evidence Retrieval Cost Reduction in Abstract Argumentation Frameworks with Fallible Evidence br
    Cohen, Andrea
    Gottifredi, Sebastian
    Garcia, Alejandro J.
    Simari, Guillermo R.
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2022, 75 : 1293 - 1322
  • [25] 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
  • [26] On Computing the Set of Acceptable Arguments in Abstract Argumentation
    Thimm, Matthias
    Cerutti, Federico
    Vallati, Mauro
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020), 2020, 326 : 363 - 370
  • [27] Uniform Argumentation Frameworks
    Atkinson, Katie
    Bench-Capon, Trevor
    Dunne, Paul E.
    Computational Models of Argument, 2012, 245 : 165 - 176
  • [28] On the Aggregation of Argumentation Frameworks
    Delobelle, Jerome
    Konieczny, Sebastien
    Vesic, Srdjan
    PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 2911 - 2917
  • [29] Abstract argumentation and (optimal) stable marriage problems
    Bistarelli, Stefano
    Santini, Francesco
    ARGUMENT & COMPUTATION, 2020, 11 (1-2) : 15 - 40
  • [30] Merging Argumentation Frameworks
    Leite, Lucas
    Alves, Thiago
    Alcantara, Joao
    2015 BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS 2015), 2015, : 110 - 115