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 条
  • [41] A Study of Unrestricted Abstract Argumentation Frameworks
    Baumann, Ringo
    Spanring, Christof
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 807 - 813
  • [42] Probabilistic Reasoning with Abstract Argumentation Frameworks
    Hunter, Anthony
    Thimm, Matthias
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 59 : 565 - 611
  • [43] Abstract Argumentation Frameworks with Domain Assignments
    Vassiliades, Alexandros
    Patkos, Theodore
    Flouris, Giorgos
    Bikakis, Antonis
    Bassiliades, Nick
    Plexousakis, Dimitris
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 2076 - 2082
  • [44] A Comparative Test on the Enumeration of Extensions in Abstract Argumentation
    Bistarelli, Stefano
    Rossi, Fabio
    Santini, Francesco
    FUNDAMENTA INFORMATICAE, 2015, 140 (3-4) : 263 - 278
  • [45] Efficiently Estimating the Probability of Extensions in Abstract Argumentation
    Fazzinga, Bettina
    Flesca, Sergio
    Parisi, Francesco
    SCALABLE UNCERTAINTY MANAGEMENT, SUM 2013, 2013, 8078 : 106 - 119
  • [46] On the Responsibility for Undecisiveness in Preferred and Stable Labellings in Abstract Argumentation (Extended Abstract)
    Schulz, Claudia
    Toni, Francesca
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 6382 - 6386
  • [47] On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks
    Wyner, Adam
    Bench-Capon, Trevor
    Dunne, Paul
    COMPUTATIONAL LOGIC IN MULTI-AGENT SYSTEMS, CLIMA XIV, 2013, 8143 : 34 - 50
  • [48] Progressive defeat paths in abstract argumentation frameworks
    Martinez, Diego C.
    Garcia, Alejandro J.
    Simari, Guillermo R.
    ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4013 : 242 - 253
  • [49] On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
    Schulz, Claudia
    Toni, Francesca
    ARTIFICIAL INTELLIGENCE, 2018, 262 : 301 - 335
  • [50] Encompassing Attacks to Attacks in Abstract Argumentation Frameworks
    Baroni, Pietro
    Cerutti, Federico
    Giacomin, Massimiliano
    Guida, Giovanni
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDINGS, 2009, 5590 : 83 - 94
12345