Computing Strongly Admissible Sets

被引：3

作者：

Dvorak, Wolfgang ^{[1
]}

Wallner, Johannes P. ^{[1
]}

机构：

[1] TU Wien, Vienna, Austria

来源：

COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020) | 2020年 / 326卷

基金：

奥地利科学基金会;

关键词：

abstract argumentation; strongly admissible; computational complexity; answer set programming; integer linear programming; ARGUMENTATION; SEMANTICS;

D O I：

10.3233/FAIA200503

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this work we revisit computational aspects of strongly admissible semantics in Dung's abstract argumentation frameworks. First, we complement the existing complexity analysis by focusing on the problem of computing strongly admissible sets of minimum size that contain a given argument and providing NP-hardness as well as hardness of approximation results. Based on these results, we then investigate two approaches to compute (minimum-sized) strongly admissible sets based on Answer Set Programming (ASP) and Integer Linear Programming (ILP), and provide an experimental comparison of their performance.

引用

页码：179 / 190

页数：12

共 50 条

[1] Characterizing strongly admissible sets
Dunne, Paul E.
ARGUMENT & COMPUTATION, 2020, 11 (03) : 239 - 255
[2] About the admissible predicates on admissible sets
Morozov, AS
SIBERIAN MATHEMATICAL JOURNAL, 2005, 46 (04) : 668 - 674
[3] About the Admissible Predicates on Admissible Sets
A. S. Morozov
Siberian Mathematical Journal, 2005, 46 : 668 - 674
[4] On Σ-definability of admissible sets
Morozov, AS
LOGIC COLLOQUIM '98, 2000, 13 : 334 - 351
[5] Admissible digit sets
Hughes, J
Niqui, M
THEORETICAL COMPUTER SCIENCE, 2006, 351 (01) : 61 - 73
[6] DETERMINED ADMISSIBLE SETS
Aguilera, J. P.
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2020, 148 (05) : 2217 - 2231
[7] ADMISSIBLE SETS OF SEMIGROUPS
刘士
沈进
何勇
湘潭师范学院学报(社会科学版), 1999, (03) : 40 - 42
[8] ON COMPACTNESS OF ADMISSIBLE PARAMETER SETS
BANKS, HT
ILES, DW
LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1987, 97 : 130 - 142
[9] A certain reducibility on admissible sets
V. G. Puzarenko
Siberian Mathematical Journal, 2009, 50 : 330 - 340
[10] INFINITARY LOGIC AND ADMISSIBLE SETS
BARWISE, J
JOURNAL OF SYMBOLIC LOGIC, 1969, 34 (02) : 226 - &

← 1 2 3 4 5 →