Talks and Poster Presentations (with Proceedings-Entry):
"On the Complexity of Computing the Justification Status of an Argument";
Talk: First International Workshop on the Theory and Applications of Formal Argumentation (TAFA-11),
- 2011-07-22; in: "Proceedings of the 1st international Workshop on the Theory and Applications of Formal Argumentation",
S. Modgil, N. Oren, F. Toni (ed.);
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.
Project Head Stefan Woltran:
Neue Methoden für Analyse, Vergleich und Lösung von Argumentationsproblemen
Created from the Publication Database of the Vienna University of Technology.