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 条
12345