Talks and Poster Presentations (with Proceedings-Entry):

B. Bliem, M. Hecher, S. Woltran:
"On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions";
Talk: COMMA - International Conference on Computational Models of Argument, Potsdam, Germany; 2016-09-12 - 2016-09-16; in: "Computational Models of Argument", P. Baroni, Th. F. Gordon, T. Scheffler, M. Stede (ed.); IOS Press, Frontiers in Artificial Intelligence and Applications 287 (2016), ISBN: 978-1-61499-685-9; 107 - 118.

English abstract:
Many computational problems in the area of abstract argumentation are intractable. For some semantics like preferred and semi-stable, important decision problems can even be hard for classes of the second level of the polynomial hierarchy. One approach to deal with this inherent difficulty is to exploit structure of argumentation frameworks. In particular, algorithms that run in linear time for argumentation frameworks of bounded treewidth have been proposed for several semantics. In this paper, we contribute to this line of research and propose a novel algorithm for the semi-stable semantics. We also present an implementation of the algorithm and report on some experimental results.

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

Related Projects:
Project Head Stefan Woltran:
Answer-Set Programming Erweiterungen für Problemlösungen auf Zerlegungen

Project Head Stefan Woltran:

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