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 条
  • [21] Aggregating Alternative Extensions of Abstract Argumentation Frameworks: Preservation Results for Quota Rules
    Chen, Weiwei
    Endriss, Ulle
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2018), 2018, 305 : 425 - 436
  • [22] Efficiently computing extensions' probabilities over probabilistic Bipolar Abstract Argumentation Frameworks
    Fazzinga, Bettina
    Flesca, Sergio
    Furfaro, Filippo
    Scala, Francesco
    INTELLIGENZA ARTIFICIALE, 2019, 13 (02) : 189 - 200
  • [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] On Preferred Extension Enumeration in Abstract Argumentation
    Nofal, Samer
    Dunne, Paul
    Atkinson, Katie
    COMPUTATIONAL MODELS OF ARGUMENT, 2012, 245 : 205 - 216
  • [26] Dual-Neighborhood Tabu Search for Computing Stable Extensions in Abstract Argumentation Frameworks
    Ke, Yuanzhi
    Hu, Xiaogang
    Sun, Junjie
    Wu, Xinyun
    Xiong, Caiquan
    Luo, Mao
    APPLIED SCIENCES-BASEL, 2024, 14 (15):
  • [27] An Incremental Algorithm for Computing the Grounded Extension of Dynamic Abstract Argumentation Frameworks
    Gianvincenzo Alfano
    Sergio Greco
    Francesco Parisi
    Group Decision and Negotiation, 2019, 28 : 935 - 960
  • [28] An Incremental Algorithm for Computing the Grounded Extension of Dynamic Abstract Argumentation Frameworks
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    GROUP DECISION AND NEGOTIATION, 2019, 28 (05) : 935 - 960
  • [29] 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
  • [30] 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
12345