Efficient problem solving on tree decompositions using binary decision diagrams
DOI10.1007/978-3-319-23264-5_19zbMATH Open1467.68043OpenAlexW2208548551MaRDI QIDQ3449205FDOQ3449205
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
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
Information storage and retrieval of data (68P20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)
Cites Work
- Title not available (Why is that?)
- Graph-Based Algorithms for Boolean Function Manipulation
- 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
- Complexity of Finding Embeddings in a k-Tree
- Title not available (Why is that?)
- Courcelle's theorem -- a game-theoretic approach
- Treewidth. Computations and approximations
- Graph minors. III. Planar tree-width
- Treewidth computations. I: Upper bounds
- BDD ordering heuristics for classical planning
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Tree decompositions of graphs: saving memory in dynamic programming
- Evaluation of an MSO-Solver
- Memory requirements for table computations in partial \(k\)-tree algorithms
- D-FLAT: declarative problem solving using tree decompositions and answer-set programming
- Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems
Cited In (6)
- Algebras for tree decomposable graphs
- D-FLAT\(^\wedge\)2: subset minimization in dynamic programming on tree decompositions made easy
- Tree decompositions of graphs: saving memory in dynamic programming
- 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
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)
