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.
DC Field
Value
Language
dc.contributor.author
Dvorak, Wolfgang
-
dc.contributor.author
Wallner, Johannes Peter
-
dc.contributor.editor
Prakken, Henry
-
dc.contributor.editor
Bistarelli, Stefano
-
dc.contributor.editor
Santini, Francesco
-
dc.contributor.editor
Taticchi, Carlo
-
dc.date.accessioned
2022-08-04T17:15:04Z
-
dc.date.available
2022-08-04T17:15:04Z
-
dc.date.issued
2020
-
dc.identifier.citation
<div class="csl-bib-body"> <div class="csl-entry">Dvorak, W., &#38; Wallner, J. P. (2020). Computing Strongly Admissible Sets. In H. Prakken, S. Bistarelli, F. Santini, &#38; C. Taticchi (Eds.), <i>Proceedings COMMA</i> (pp. 179–190). IOs Press. http://hdl.handle.net/20.500.12708/58171</div> </div>
-
dc.identifier.isbn
978-1-64368-107-8
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/58171
-
dc.description.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
dc.publisher
IOs Press
-
dc.title
Computing Strongly Admissible Sets
-
dc.type
Konferenzbeitrag
de
dc.type
Inproceedings
en
dc.relation.publication
Proceedings COMMA
-
dc.description.startpage
179
-
dc.description.endpage
190
-
dc.type.category
Full-Paper Contribution
-
dc.publisher.place
2326
-
tuw.booktitle
Proceedings COMMA
-
tuw.peerreviewed
true
-
tuw.project.title
EMBArg
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
dc.description.numberOfPages
12
-
tuw.event.name
COMMA - International Conference on Computational Models of Argument
-
tuw.event.startdate
08-09-2020
-
tuw.event.enddate
11-09-2020
-
tuw.event.online
Online
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Liverpool
-
tuw.event.country
GB
-
tuw.event.presenter
Wallner, Johannes Peter
-
tuw.presentation.online
Online
-
wb.sciencebranch
Informatik
-
wb.sciencebranch.oefos
1020
-
wb.facultyfocus
Logic and Computation (LC)
de
wb.facultyfocus
Logic and Computation (LC)
en
wb.facultyfocus.faculty
E180
-
wb.presentation.type
science to science/art to art
-
item.openairetype
conference paper
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
item.grantfulltext
none
-
item.cerifentitytype
Publications
-
item.fulltext
no Fulltext
-
crisitem.project.funder
FWF Fonds zur Förderung der wissenschaftlichen Forschung (FWF)
-
crisitem.project.grantno
P30168-N31
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
crisitem.author.orcid
0000-0002-2269-8193
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
crisitem.author.parentorg
E192 - Institut für Logic and Computation
-
Appears in Collections:
Conference Paper
Show simple item record

Page view(s)

176
checked on Nov 23, 2023

Download(s)

2
checked on Nov 23, 2023

Google ScholarTM

Check