Talks and Poster Presentations (with Proceedings-Entry):
R. Brochenin, T. Linsbichler, M. Maratea, J. Wallner, S. Woltran:
"Abstract Solvers for Dung's Argumentation Frameworks";
Talk: The 2015 International Workshop on Theory and Applications of Formal Argument,
Buenos Aires, Argentinien;
- 07-26-2015; in: "Theory and Applications of Formal Argumentation",
E. Black, S. Modgil, N. Oren (ed.);
Lecture Notes in Computer Science,
Abstract solvers are a quite recent method to uniformly describe algorithms in a rigorous formal way and have proven successful in declarative paradigms such as Propositional Satisfiability and Answer-Set Programming. In this paper, we apply this machinery for the first time to a dedicated AI formalism, namely Dung´s abstract argumentation frameworks. We provide descriptions of several advanced algorithms for the preferred semantics in terms of abstract solvers and, moreover, show how slight adaptions thereof directly lead to new algorithms.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Created from the Publication Database of the Vienna University of Technology.