Talks and Poster Presentations (with Proceedings-Entry):
"Perfection in abstract argumentation";
Talk: 6th International Conference on Computational Models of Argument (COMMA 2016),
- 09-16-2016; in: "Computational Models of Argument - Proceedings of COMMA 2016",
P. Baroni, Th. F. Gordon, T. Scheffler, M. Stede (ed.);
Frontiers in Artificial Intelligence and Applications 287
It is a well-known fact that stable semantics might not provide any extensions for some given abstract argumentation framework. Arguably such frameworks might be considered futile, at least with respect to stable semantics. We propagate σ-perfection stating that for a given argumentation graph all induced subgraphs provide σ-extensions. We discuss perfection and conditions for popular abstract argumentation semantics and possibly infinite frameworks.
Created from the Publication Database of the Vienna University of Technology.