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 条
  • [1] On Admissibility in Timed Abstract Argumentation Frameworks
    Laura Cobo, Ma
    Martinez, Diego C.
    Simari, Guillermo R.
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 1007 - 1008
  • [2] On checking skeptical and ideal admissibility in abstract argumentation frameworks
    Nofal, Samer
    Atkinson, Katie
    Dunne, Paul E.
    INFORMATION PROCESSING LETTERS, 2019, 148 : 7 - 12
  • [3] Guaranteeing admissibility of abstract argumentation frameworks with rationality and feasibility constraints
    Chen, Weiwei
    JOURNAL OF LOGIC AND COMPUTATION, 2021, 31 (08) : 2133 - 2158
  • [4] Non-Admissibility in Abstract Argumentation
    Dvorak, Wolfgang
    Rienstra, Tjitze
    van der Torre, Leendert
    Woltran, Stefan
    COMPUTATIONAL MODELS OF ARGUMENT, COMMA 2022, 2022, 353 : 128 - 139
  • [5] Deciding Acceptance in Incomplete Argumentation Frameworks
    Niskanen, Andreas
    Neugebauer, Daniel
    Jaervisalo, Matti
    Rothe, Joerg
    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 : 2942 - 2949
  • [6] New Weak Admissibility Semantics for Abstract Argumentation
    Dauphin, Jeremie
    Rienstra, Tjitze
    van der Torre, Leendert
    LOGIC AND ARGUMENTATION, CLAR 2021, 2021, 13040 : 112 - 126
  • [7] Abstract argumentation scheme frameworks
    Atkinson, Katie
    Bench-Capon, Trevor
    ARTIFICIAL INTELLIGENCE: METHODOLOGY, SYSTEMS, AND APPLICATIONS, 2008, 5253 : 220 - 234
  • [8] Merging of Abstract Argumentation Frameworks
    Delobelle, Jerome
    Haret, Adrian
    Konieczny, Sebastien
    Mailly, Jean-Guy
    Rossit, Julien
    Woltran, Stefan
    FIFTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2016, : 33 - 42
  • [9] Strong Admissibility for Abstract Dialectical Frameworks
    Zafarghandi, Atefeh Keshavarzi
    Verbrugge, Rineke
    Verheij, Bart
    36TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, SAC 2021, 2021, : 873 - 880
  • [10] Strong admissibility for abstract dialectical frameworks
    Zafarghandi, Atefeh Keshavarzi
    Verbrugge, Rineke
    Verheij, Bart
    ARGUMENT & COMPUTATION, 2022, 13 (03) : 249 - 289
12345