Publications in Scientific Journals:
M. Abseher, M. Hecher, M. Moldovan, S. Woltran, B. Bliem:
"Dynamic Programming on Tree Decompositions with {D-FLAT}";
KI - Künstliche Intelligenz,
32
(2018),
2-3;
191
- 192.
English abstract:
Many hard problems can be solved efficiently by dynamic programming algorithms that work on tree decompositions. In this paper, we present the D-FLAT system for rapid prototyping of such algorithms. Users can specify the algorithm for their problem using Answer Set Programming. We illustrate the framework by an example and briefly discuss its main features.
Keywords:
Tree decomposition, Answer set programming, Dynamic programming
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/s13218-018-0531-2
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.