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 条
  • [31] A SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation
    Cerutti, Federico
    Giacomin, Massimiliano
    Vallati, Mauro
    Zanella, Marina
    FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2014, : 42 - 51
  • [32] Selecting Extensions in Weighted Argumentation Frameworks
    Coste-Marquis, Sylvie
    Konieczny, Sebastien
    Marquis, Pierre
    Ouali, Mohand Akli
    COMPUTATIONAL MODELS OF ARGUMENT, 2012, 245 : 342 - 349
  • [33] On Deciding Admissibility in Abstract Argumentation Frameworks
    Nofal, Samer
    Atkinson, Katie
    Dunne, Paul E.
    KEOD: PROCEEDINGS OF THE 11TH INTERNATIONAL JOINT CONFERENCE ON KNOWLEDGE DISCOVERY, KNOWLEDGE ENGINEERING AND KNOWLEDGE MANAGEMENT - VOL 2: KEOD, 2019, : 67 - 75
  • [34] On acceptance conditions in abstract argumentation frameworks
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    Trubitsyna, Irina
    INFORMATION SCIENCES, 2023, 625 : 757 - 779
  • [35] Rationalisation of Profiles of Abstract Argumentation Frameworks: Extended Abstract
    Airiau, Stephane
    Bonzon, Elise
    Endriss, Ulle
    Maudet, Nicolas
    Rossit, Julien
    PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 4776 - 4780
  • [36] 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
  • [37] On the Complexity of Probabilistic Abstract Argumentation Frameworks
    Fazzinga, Bettina
    Flesca, Sergio
    Parisi, Francesco
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2015, 16 (03)
  • [38] Abstract Argumentation Frameworks with Fallible Evidence
    Skiba, Kenneth
    Thimm, Matthias
    Cohen, Andrea
    Gottifredi, Sebastian
    Garcia, Alejandro J.
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020), 2020, 326 : 347 - 354
  • [39] Rationalisation of Profiles of Abstract Argumentation Frameworks
    Airiau, Stephane
    Bonzon, Elise
    Endriss, Ulle
    Maudet, Nicolas
    Rossit, Julien
    AAMAS'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2016, : 350 - 357
  • [40] Dynamic Argumentation in Abstract Dialogue Frameworks
    Julieta Marcos, M.
    Falappa, Marcelo A.
    Simari, Guillermo R.
    ARGUMENTATION IN MULTI-AGENT SYSTEMS (ARGMAS), 2011, 6614 : 228 - 247
12345