Computing Grounded Extensions Of Abstract Argumentation Frameworks

被引：2
|
作者：
Nofal, Samer [1 ]
Atkinson, Katie [2 ]
Dunne, Paul E. [2 ]
机构：
[1] German Jordanian Univ, Dept Comp Sci, Amman Madaba St, Amman 11180, Jordan
[2] Univ Liverpool, Dept Comp Sci, Ashton St, Liverpool L69 3BX, Merseyside, England
来源：
COMPUTER JOURNAL | 2021年 / 64卷 / 01期
关键词：
directed graph; algorithm; grounded extension; argumentation graph; argumentation semantics; abstract argumentation framework;
D O I：
10.1093/comjnl/bxz138
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
An abstract argumentation framework is a directed graph (V, E) such that the vertices of V denote abstract arguments and E subset of V x V represents the attack relation between them. We present a new ad hoc algorithm for computing the grounded extension of an abstract argumentation framework. We show that the new algorithm runs in O(vertical bar V vertical bar + vertical bar E vertical bar) time. In contrast, the existing state-of-the-art algorithm runs in O(vertical bar V vertical bar vertical bar S vertical bar vertical bar E vertical bar) time where S is the grounded extension of the input graph.
引用
收藏
页码：54 / 63
页数：10
相关论文
共 50 条
  • [21] Validation of Labelling Algorithms for Abstract Argumentation Frameworks: The Case of Listing Stable Extensions
    Nofal, Samer
    Abu Jabal, Amani
    Alfarrarjeh, Abdullah
    Hababeh, Ismail
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, ICAISC 2022, PT I, 2023, 13588 : 423 - 435
  • [22] Computing Stable Extensions of Argumentation Frameworks using Formal Concept Analysis
    Obiedkov, Sergei
    Sertkaya, Baris
    LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2023, 2023, 14281 : 176 - 191
  • [23] Abstract argumentation scheme frameworks
    Atkinson, Katie
    Bench-Capon, Trevor
    ARTIFICIAL INTELLIGENCE: METHODOLOGY, SYSTEMS, AND APPLICATIONS, 2008, 5253 : 220 - 234
  • [24] 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
  • [25] New stochastic local search approaches for computing preferred extensions of abstract argumentation
    Niu, Dangdang
    Liu, Lei
    Lu, Shuai
    AI COMMUNICATIONS, 2018, 31 (04) : 369 - 382
  • [26] Skeptical Reasoning with Preferred Semantics in Abstract Argumentation without Computing Preferred Extensions
    Thimm, Matthias
    Cerutti, Federico
    Vallati, Mauro
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 2069 - 2075
  • [27] A New Stochastic Local Search Approach for Computing Preferred Extensions of Abstract Argumentation
    Niu, Dangdang
    Liu, Lei
    Lu, Shuai
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1652 - 1653
  • [28] A logic of argumentation for specification and verification of abstract argumentation frameworks
    Villata, Serena
    Boella, Guido
    Gabbay, Dov M.
    van der Torre, Leendert
    Hulstijn, Joris
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2012, 66 (1-4) : 199 - 230
  • [29] A logic of argumentation for specification and verification of abstract argumentation frameworks
    Serena Villata
    Guido Boella
    Dov M. Gabbay
    Leendert van der Torre
    Joris Hulstijn
    Annals of Mathematics and Artificial Intelligence, 2012, 66 : 199 - 230
  • [30] On Computing Explanations in Abstract Argumentation
    Fan, Xiuyi
    Toni, Francesca
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 1005 - 1006
12345