A New Stochastic Local Search Approach for Computing Preferred Extensions of Abstract Argumentation

被引：2
|
作者：
Niu, Dangdang [1 ]
Liu, Lei [1 ]
Lu, Shuai [1 ,2 ,3 ]
机构：
[1] Jilin Univ, Coll Comp Sci & Technol, Changchun 130012, Peoples R China
[2] Jilin Univ, Coll Math, Changchun 130012, Peoples R China
[3] Jilin Univ, Minist Educ, Key Lab Symbol Computat & Knowledge Engn, Changchun 130012, Peoples R China
来源：
ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2016年 / 285卷
关键词：
D O I：
10.3233/978-1-61499-672-9-1652
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we proposed a new stochastic local search algorithm Inc-CCAEP for computing the preferred extensions in (abstract) argumentation frameworks (AF). Inc-CCAEP realizes an incremental version of Swcca, specially designed for computing the preferred extensions in AF. Experiments show that, Inc-CCAEP notably outperforms the state-of-the-art solvers consistently on random benchmarks with nonempty preferred extensions.
引用
收藏
页码：1652 / 1653
页数：2
相关论文
共 49 条
  • [1] 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
  • [2] 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
  • [3] A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks
    Nofal, Samer
    Atkinson, Katie
    Dunne, Paul E.
    Hababeh, Ismail
    PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS (ICEIS), VOL 1, 2019, : 340 - 348
  • [4] On Scaling the Enumeration of the Preferred Extensions of Abstract Argumentation Frameworks
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 1147 - 1153
  • [5] Computing Grounded Extensions Of Abstract Argumentation Frameworks
    Nofal, Samer
    Atkinson, Katie
    Dunne, Paul E.
    COMPUTER JOURNAL, 2021, 64 (01): : 54 - 63
  • [6] Stochastic Local Search Algorithms for Abstract Argumentation Under Stable Semantics
    Thimm, Matthias
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2018), 2018, 305 : 169 - 180
  • [7] 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):
  • [8] Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments
    Nielsen, Soren Holbech
    Parsons, Simon
    COMPUTATIONAL MODELS OF ARGUMENT, 2006, 144 : 97 - +
  • [9] Computing Extensions' Probabilities in Probabilistic Abstract Argumentation: Beyond Independence
    Fazzinga, Bettina
    Flesca, Sergio
    Furfaro, Filippo
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1588 - 1589
  • [10] A New Method for Computing Preferred Extensions
    Zhang, Xindi
    Xie, Xiaojie
    Pan, Yancen
    Niu, Dangdang
    Lu, Shuai
    IIP'17: PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION PROCESSING, 2017,
12345