Dvorak, W. (2011). On the Complexity of Computing the Justification Status of an Argument. In S. Modgil, N. Oren, & F. Toni (Eds.), Proceedings of the 1#^{st} international Workshop on the Theory and Applications of Formal Argumentation (pp. 32–49). http://ijcai-11.iiia.csic.es/files/proceedings/W25-%20TAFA-post-proceedings.pdf. http://hdl.handle.net/20.500.12708/53699
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
Project title:
New Methods for Analyzing, Comparing, and Solving Argumentation Problems (WWTF Wiener Wissenschafts-, Forschu und Technologiefonds)
