Talks and Poster Presentations (with Proceedings-Entry):
B. Bliem, G. Charwat, M. Hecher, S. Woltran:
"Subset Minimization in Dynamic Programming on Tree Decompositions";
Talk: AAAI-16 Workshop on Beyond NP,
Phoenix, Arizona, USA;
2016-02-12; in: "Beyond NP, Papers from the 2016 AAAI Workshop",
A. Darwiche (ed.);
AAAI Press,
WS-16-05
(2016),
300
- 306.
English abstract:
Many problems from the area of AI have been shown tractable for bounded treewidth. In order to put such results into practice, quite involved dynamic programming (DP) algorithms on tree decompositions have to be designed and implemented. These algorithms typically show recurring patterns that call for tasks like subset minimization. In this paper, we provide a new method for obtaining DP algorithms from simpler principles, where the necessary data structures and algorithms for subset minimization are automatically generated. Moreover, we discuss how this method can be implemented in systems that perform more space-efficiently than current approaches.
Related Projects:
Project Head Stefan Woltran:
Answer-Set Programming Erweiterungen für Problemlösungen auf Zerlegungen
Project Head Stefan Woltran:
START
Created from the Publication Database of the Vienna University of Technology.