Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag):
W. Dvorak, J. P. Wallner:
"Computing Strongly Admissible Sets";
Vortrag: COMMA - International Conference on Computational Models of Argument,
online;
08.09.2020
- 11.09.2020; in: "Proceedings COMMA",
H. Prakken, S. Bistarelli, F. Santini, C. Taticchi (Hrg.);
IOs Press,
2326
(2020),
ISBN: 978-1-64368-107-8;
S. 179
- 190.
Kurzfassung englisch:
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.
"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.3233/FAIA200503
Zugeordnete Projekte:
Projektleitung Johannes Peter Wallner:
EMBArg
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.