Validation of Labelling Algorithms for Abstract Argumentation Frameworks: The Case of Listing Stable Extensions

被引：0

作者：

Nofal, Samer ^{[1
]}

Abu Jabal, Amani ^{[1
]}

Alfarrarjeh, Abdullah ^{[1
]}

Hababeh, Ismail ^{[1
]}

机构：

[1] German Jordanian Univ, Dept Comp Sci, Amman, Jordan

来源：

ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, ICAISC 2022, PT I | 2023年 / 13588卷

关键词：

Nonmonotonic reasoning; Abstract argumentation; Stable semantics; Labelling algorithm; Backtracking algorithm; np-hard;

D O I：

10.1007/978-3-031-23492-7_36

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

An abstract argumentation framework (AF for short) is a pair (A, R) where A is a set of abstract arguments and R subset of A x A is the attack relation. Let H = (A, R) be an af, S subset of A be a set of arguments and S+ = {y | there exists x is an element of S with (x, y) is an element of R}. Then, S is a stable extension in H if and only if S (+) = A\S. In this paper, we present a thorough, formal validation of a known labelling algorithm for listing all stable extensions in a given AF.

引用

页码：423 / 435

页数：13

共 24 条

[1] A New Labelling Algorithm for Generating Preferred Extensions of Abstract Argumentation Frameworks
Nofal, Samer
Atkinson, Katie
Dunne, Paul E.
Hababeh, Ismail
[J]. PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS (ICEIS), VOL 1, 2019, : 340 - 348
[2] 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
[3] Computing Grounded Extensions Of Abstract Argumentation Frameworks
Nofal, Samer
Atkinson, Katie
Dunne, Paul E.
[J]. COMPUTER JOURNAL, 2021, 64 (01): : 54 - 63
[4] A tool for merging extensions of abstract argumentation frameworks
Delobelle, Jerome
Mailly, Jean-Guy
[J]. ARGUMENT & COMPUTATION, 2022, 13 (03) : 361 - 368
[5] Dual-Neighborhood Tabu Search for Computing Stable Extensions in Abstract Argumentation Frameworks
Ke, Yuanzhi
Hu, Xiaogang
Sun, Junjie
Wu, Xinyun
Xiong, Caiquan
Luo, Mao
[J]. APPLIED SCIENCES-BASEL, 2024, 14 (15):
[6] 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
[7] 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
[8] An Infinite-Valued Grounded Labelling for Abstract Argumentation Frameworks
Alcantara, Joao
Sa, Samy
[J]. 33RD ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, 2018, : 903 - 910
[9] Abstract and Concrete Decision Graphs for Choosing Extensions of Argumentation Frameworks
Dauphin, Jeremie
Cramer, Marcos
van der Torre, Leendert
[J]. COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2018), 2018, 305 : 437 - 444
[10] On the Computation of Top-k Extensions in Abstract Argumentation Frameworks
Jabbour, Said
Raddaoui, Badran
Sais, Lakhdar
Salhi, Yakoub
[J]. ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 913 - 920

← 1 2 3 →