Talks and Poster Presentations (with Proceedings-Entry):
B. Bliem, R. Pichler, S. Woltran:
"Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem";
Talk: International Symposium on Parameterized and Exact Computation (IPEC),
- 2013-09-06; in: "Parameterized and Exact Computation",
G. Gutin, St. Szeider (ed.);
Many computationally hard problems become tractable if the graph structure underlying the problem instance exhibits small treewidth. A recent approach to put this idea into practice is based on a declarative interface to specify dynamic programming over tree decompositions, delegating the computation to dedicated solvers. In this paper, we prove that this method can be applied to any problem whose fixed-parameter tractability follows from Courcelle´s Theorem.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Project Head Stefan Woltran:
Answer-Set Programming Erweiterungen für Problemlösungen auf Zerlegungen
Created from the Publication Database of the Vienna University of Technology.