Skip to main content
Log in

Dynamic Programming on Tree Decompositions with D-FLAT

KI - Künstliche Intelligenz Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

References

  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

    Article  MathSciNet  MATH  Google Scholar 

  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

    MathSciNet  MATH  Google Scholar 

  6. Niedermeier R (2006) Invitation to fixed-parameter algorithms. In: Oxford lecture series in mathematics and its applications, vol 31. Oxford University Press

  7. Robertson N, Seymour PD (1984) Graph minors. III. Planar tree-width. J Combin Theory Ser B 36(1):49–64

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the Austrian Science Fund (FWF) projects P25607 and Y698.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bernhard Bliem.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13218-018-0531-2

Keywords

Navigation