Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems

DOI10.1007/11493853_26MaRDI QIDQ5450944zbMATH OpenOpenAlexFDO

Authors Sathiamoorthy Subbarayan

Publication date 17 March 2008

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11493853_26

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Compiling CSPs into tree-driven automata for interactive solving
• Consistency restoration and explanations in dynamic CSPs---Application to configuration
• Interactive Cost Configuration Over Decision Diagrams
• scientific article; zbMATH DE number 1943831
• Compiling CP subproblems to MDDs and d-DNNFs

Cited in

(5)

• Compiling CSPs into tree-driven automata for interactive solving
• Algorithms for the maximum weight connected k-induced subgraph problem
• Efficient problem solving on tree decompositions using binary decision diagrams
• Changing System Interfaces Consistently: A New Refinement Strategy for CSP||B
• scientific article; zbMATH DE number 1943831 (Why is no real title available?)

Describes a project that uses

Uses Software

• BuDDy

This page was built for publication: Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems

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