<div class="csl-bib-body">
<div class="csl-entry">Dvorak, W. (2011). On the Complexity of Computing the Justification Status of an Argument. In S. Modgil, N. Oren, & F. Toni (Eds.), <i>Proceedings of the 1#^{st} international Workshop on the Theory and Applications of Formal Argumentation</i> (pp. 32–49). http://ijcai-11.iiia.csic.es/files/proceedings/W25-%20TAFA-post-proceedings.pdf. http://hdl.handle.net/20.500.12708/53699</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/53699
-
dc.description.abstract
We address the problem of determining the acceptance status of an
argument w.r.t. labeling-based semantics. Wu and Caminada recently proposed a labeling-based justification status of arguments to distinguish different levels of acceptability for arguments. We generalize their approach, which was originally restricted to complete semantics, to arbitrary argumentation semantics and
provide a comprehensive study of the computational properties.
en
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds