D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming

Bernhard Bliem, Michael Morak, Stefan Woltran

In this work, we propose Answer-Set Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms…