Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams

DOI10.1007/978-3-319-23264-5_19zbMath1467.68043OpenAlexW2208548551MaRDI QIDQ3449205

Stefan Woltran, Günther Charwat

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Courcelle's theorem -- a game-theoretic approach
• Graph minors. III. Planar tree-width
• Treewidth computations. I: Upper bounds
• Treewidth. Computations and approximations
• Memory requirements for table computations in partial \(k\)-tree algorithms
• Towards fixed-parameter tractable algorithms for abstract argumentation
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Tree decompositions of graphs: saving memory in dynamic programming
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• BDD Ordering Heuristics for Classical Planning
• Graph-Based Algorithms for Boolean Function Manipulation
• Complexity of Finding Embeddings in a k-Tree
• D-FLAT: Declarative problem solving using tree decompositions and answer-set programming
• Evaluation of an MSO-Solver
• Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems

This page was built for publication: Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams