Talks and Poster Presentations (with Proceedings-Entry):

T. Linsbichler, M. Maratea, A. Niskanen, J. P. Wallner, S. Woltran:
"Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving";
Talk: International Joint Conference on Artificial Intelligence (IJCAI), Stockholm; 2018-07-13 - 2018-07-19; in: "Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence", J. Lang (ed.); IJCAI, (2018), 1905 - 1911.

English abstract:
Abstract dialectical frameworks (ADFs) constitute one of the most powerful formalisms in abstract argumentation. Their high computational complexity poses, however, certain challenges when designing efficient systems. In this paper, we tackle this issue by (i) analyzing the complexity of ADFs under structural restrictions, (ii) presenting novel algorithms which make use of these insights, and (iii) empirically evaluating a resulting implementation which relies on calls to SAT solvers.

"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)

Related Projects:
Project Head Johannes Peter Wallner:

Project Head Stefan Woltran:
Neue Werkzeuge für graphenbasierte formale Argumentation

Project Head Stefan Woltran:

Created from the Publication Database of the Vienna University of Technology.