Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag):
B. Bliem, M. Hecher, S. Woltran:
"On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions";
Vortrag: COMMA - International Conference on Computational Models of Argument,
Potsdam, Germany;
12.09.2016
- 16.09.2016; in: "Computational Models of Argument",
P. Baroni, Th. F. Gordon, T. Scheffler, M. Stede (Hrg.);
IOS Press,
Frontiers in Artificial Intelligence and Applications 287
(2016),
ISBN: 978-1-61499-685-9;
S. 107
- 118.
Kurzfassung englisch:
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.
"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.3233/978-1-61499-686-6-107
Zugeordnete Projekte:
Projektleitung Stefan Woltran:
Answer-Set Programming Erweiterungen für Problemlösungen auf Zerlegungen
Projektleitung Stefan Woltran:
START
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.