A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks

被引：0
|
作者：
Nofal, Samer [1 ]
Atkinson, Katie [2 ]
Dunne, Paul E. [2 ]
Hababeh, Ismail [1 ]
机构：
[1] German Jordanian Univ, Dept Comp Sci, Madaba, Jordan
[2] Univ Liverpool, Dept Comp Sci, Liverpool, Merseyside, England
来源：
PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS (ICEIS), VOL 1 | 2019年
关键词：
Abstract Argumentation; Argumentation Semantics; Labelling Semantics; Argumentation Algorithm; Labelling Algorithm; Preferred Semantics;
D O I：
10.5220/0007737503400348
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The field of computational models of argument aims to provide support for automated reasoning through algorithms that operate on arguments and attack relations between them. In this paper we present a new labelling algorithm that lists all preferred extensions of an abstract argumentation framework. The new algorithm is enhanced by a new pruning strategy. We verified our new labelling algorithm and showed that it enumerates preferred extensions faster than the old labelling algorithm.
引用
收藏
页码：340 / 348
页数：9
相关论文
共 50 条
  • [1] On Scaling the Enumeration of the Preferred Extensions of Abstract Argumentation Frameworks
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    [J]. SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 1147 - 1153
  • [2] Validation of Labelling Algorithms for Abstract Argumentation Frameworks: The Case of Listing Stable Extensions
    Nofal, Samer
    Abu Jabal, Amani
    Alfarrarjeh, Abdullah
    Hababeh, Ismail
    [J]. ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, ICAISC 2022, PT I, 2023, 13588 : 423 - 435
  • [3] On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks
    Kroell, Markus
    Pichler, Reinhard
    Woltran, Stefan
    [J]. PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 1145 - 1152
  • [4] Computing Grounded Extensions Of Abstract Argumentation Frameworks
    Nofal, Samer
    Atkinson, Katie
    Dunne, Paul E.
    [J]. COMPUTER JOURNAL, 2021, 64 (01): : 54 - 63
  • [5] A tool for merging extensions of abstract argumentation frameworks
    Delobelle, Jerome
    Mailly, Jean-Guy
    [J]. ARGUMENT & COMPUTATION, 2022, 13 (03) : 361 - 368
  • [6] On the preferred extensions of argumentation frameworks: Bijections with naive sets
    Elaroussi, Mohammed
    Nourine, Lhouari
    Radjef, Mohammed Said
    Vilmin, Simon
    [J]. INFORMATION PROCESSING LETTERS, 2023, 181
  • [7] New stochastic local search approaches for computing preferred extensions of abstract argumentation
    Niu, Dangdang
    Liu, Lei
    Lu, Shuai
    [J]. AI COMMUNICATIONS, 2018, 31 (04) : 369 - 382
  • [8] A New Stochastic Local Search Approach for Computing Preferred Extensions of Abstract Argumentation
    Niu, Dangdang
    Liu, Lei
    Lu, Shuai
    [J]. ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1652 - 1653
  • [9] On efficiently estimating the probability of extensions in abstract argumentation frameworks
    Fazzinga, Bettina
    Flesca, Sergio
    Parisi, Francesco
    [J]. INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2016, 69 : 106 - 132
  • [10] Skeptical Reasoning with Preferred Semantics in Abstract Argumentation without Computing Preferred Extensions
    Thimm, Matthias
    Cerutti, Federico
    Vallati, Mauro
    [J]. PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 2069 - 2075
12345