Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/58171
-
Title: 
Computing Strongly Admissible Sets
-
Citation: 
Dvorak, W., & Wallner, J. P. (2020). Computing Strongly Admissible Sets. In H. Prakken, S. Bistarelli, F. Santini, & C. Taticchi (Eds.), Proceedings COMMA (pp. 179–190). IOs Press. http://hdl.handle.net/20.500.12708/58171
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
Dvorak, Wolfgang 
Wallner, Johannes Peter 
-
Organisational Unit: 
E192-02 - Forschungsbereich Databases and Artificial Intelligence 
-
Published in: 
Proceedings COMMA 
-
Date (published): 
2020
-
Event name: 
COMMA - International Conference on Computational Models of Argument 
-
Event date: 
8-Sep-2020 - 11-Sep-2020
-
Event place: 
Liverpool, United Kingdom of Great Britain and Northern Ireland (the)
-
Number of Pages: 
12
-
Publisher: 
IOs Press, 2326
-
Peer reviewed: 
Yes
-
Abstract: 
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.
en
Project title: 
EMBArg 
-
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

176
checked on Nov 23, 2023

Download(s)

2
checked on Nov 23, 2023

Google ScholarTM

Check