Efficient problem solving on tree decompositions using binary decision diagrams

DOI10.1007/978-3-319-23264-5_19MaRDI QIDQ3449205zbMATH OpenOpenAlexFDO

Authors Günther Charwat, Stefan Woltran

Publication date 4 November 2015

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-23264-5_19

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Recommendations

• Improving the efficiency of dynamic programming on tree decompositions via machine learning
• Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
• Tree decompositions of graphs: saving memory in dynamic programming
• The Fine Details of Fast Dynamic Programming over Tree Decompositions
• Space saving by dynamic algebraization based on tree-depth

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• BDD ordering heuristics for classical planning
• Complexity of Finding Embeddings in a k-Tree
• Courcelle's theorem -- a game-theoretic approach
• D-FLAT: declarative problem solving using tree decompositions and answer-set programming
• Evaluation of an MSO-Solver
• Graph minors. III. Planar tree-width
• Graph-Based Algorithms for Boolean Function Manipulation
• Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems
• Memory requirements for table computations in partial \(k\)-tree algorithms
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Towards fixed-parameter tractable algorithms for abstract argumentation
• Tree decompositions of graphs: saving memory in dynamic programming
• Treewidth computations. I: Upper bounds
• Treewidth. Computations and approximations

Cited in

(6)

• Tree decompositions of graphs: saving memory in dynamic programming
• The D-FLAT system for dynamic programming on tree decompositions
• Improving the efficiency of dynamic programming on tree decompositions via machine learning
• Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
• Algebras for tree decomposable graphs
• D-FLAT\(^\wedge\)2: subset minimization in dynamic programming on tree decompositions made easy

This page was built for publication: Efficient problem solving on tree decompositions using binary decision diagrams

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