Declarative dynamic programming as an alternative realization of Courcelle's theorem

DOI10.1007/978-3-319-03898-8_4MaRDI QIDQ2867070zbMATH OpenOpenAlexFDO

Authors Bernhard Bliem, Reinhard Pichler, Stefan Woltran

Publication date 10 December 2013

Published in Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-03898-8_4

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Recommendations

• Implementing Courcelle's theorem in a declarative framework for dynamic programming
• A Practical Approach to Courcelle's Theorem
• Practical access to dynamic programming on tree decompositions
• Practical access to dynamic programming on tree decompositions
• Courcelle's theorem -- a game-theoretic approach

Cited in

(5)

• Practical access to dynamic programming on tree decompositions
• On the connections between PCTL and dynamic programming
• Implementing Courcelle's theorem in a declarative framework for dynamic programming
• Practical access to dynamic programming on tree decompositions
• Structure-guided automated reasoning

Describes a project that uses

Uses Software

• D-FLAT
• MONA
• Clingo

This page was built for publication: Declarative dynamic programming as an alternative realization of Courcelle's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867070)