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.
References
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
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
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
Bliem B, Moldovan M, Woltran S (2017) The D-FLAT system: user manual. Technical report, DBAI-TR-2017-107, DBAI, TU Wien, Vienna, Austria
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
Niedermeier R (2006) Invitation to fixed-parameter algorithms. In: Oxford lecture series in mathematics and its applications, vol 31. Oxford University Press
Robertson N, Seymour PD (1984) Graph minors. III. Planar tree-width. J Combin Theory Ser B 36(1):49–64
Acknowledgements
This work was supported by the Austrian Science Fund (FWF) projects P25607 and Y698.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Abseher, M., Bliem, B., Hecher, M. et al. Dynamic Programming on Tree Decompositions with D-FLAT. Künstl Intell 32, 191–192 (2018). https://doi.org/10.1007/s13218-018-0531-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13218-018-0531-2