Talks and Poster Presentations (with Proceedings-Entry):
W. Dvorak, J. P. Wallner:
"Computing Strongly Admissible Sets";
Talk: COMMA - International Conference on Computational Models of Argument,
- 09-11-2020; in: "Proceedings COMMA",
H. Prakken, S. Bistarelli, F. Santini, C. Taticchi (ed.);
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.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Project Head Johannes Peter Wallner:
Created from the Publication Database of the Vienna University of Technology.