1. Abseher M, Bliem B, Charwat G, Dusberger F, Hecher M, Woltran S (2014) The D-FLAT system for dynamic programming on tree decompositions. In: Proceedings of the JELIA 2014, LNCS, vol 8761. Springer, pp 558–572
2. Bliem B, Charwat G, Hecher M, Woltran S (2016)
$$D{\text{- }}FLAT^2$$
: subset minimization in dynamic programming on tree decompositions made easy. Fundam Inform 147(1):27–61
3. Bliem B, Kaufmann B, Schaub T, Woltran S (2016) ASP for anytime dynamic programming on tree decompositions. In: Proceedings of IJCAI 2016. AAAI Press, pp 979–986
4. Bliem B, Moldovan M, Woltran S (2017) The D-FLAT system: user manual. Technical report, DBAI-TR-2017-107, DBAI, TU Wien, Vienna, Austria
5. Bliem B, Pichler R, Woltran S (2017) Implementing Courcelle’s theorem in a declarative framework for dynamic programming. J Logic Comput 27(4):1067–1094