Implementing Courcelle's theorem in a declarative framework for dynamic programming

DOI10.1093/LOGCOM/EXV089MaRDI QIDQ3133156zbMATH OpenOpenAlexFDO

Authors Bernhard Bliem, Reinhard Pichler, Stefan Woltran

Publication date 13 February 2018

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exv089

Mathematics Subject Classification ID

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

Recommendations

• Declarative dynamic programming as an alternative realization of Courcelle's theorem
• 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)

• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• Declarative dynamic programming as an alternative realization of Courcelle's theorem
• D-FLAT: declarative problem solving using tree decompositions and answer-set programming
• Practical access to dynamic programming on tree decompositions
• Practical access to dynamic programming on tree decompositions

This page was built for publication: Implementing Courcelle's theorem in a declarative framework for dynamic programming

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