Dynamic Programming on Tree Decompositions with D-FLAT

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.