Integrating CSP decomposition techniques and BDDs for compiling configuration problems

Authors:
Sathiamoorthy Subbarayan
Affiliations:
Department of Innovation, The IT University of Copenhagen, Denmark
Venue:
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2005

Citing 13
Cited 6

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Decomposing constraint satisfaction problems using database techniques

Artificial Intelligence
Using OBDDs to handle dynamic constraints

Information Processing Letters
Compiling constraint satisfaction problems

Artificial Intelligence
Consistency restoriation and explanations in dynamic CSPs----application to configuration

Artificial Intelligence
Introduction to Algorithms

Introduction to Algorithms
Non-linear quantification scheduling in image computation

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Constraint Processing

Constraint Processing
Dynamic Scheduling and Clustering in Symbolic Image Computation

Proceedings of the conference on Design, automation and test in Europe
Compiling CSPs into Tree-Driven Automata for Interactive Solving

Constraints
Computing explanations and implications in preference-based configurators

ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Dynamic constraint satisfaction problems

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Eliminating interchangeable values in constraint satisfaction problems

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1

Tangible user interfaces for configuration practices

Proceedings of the 1st international conference on Tangible and embedded interaction
Approximate compilation for embedded model-based reasoning

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Compressing configuration data for memory limited devices

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Knowledge compilation properties of tree-of-BDDs

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A dynamic constraint satisfaction approach for configuring structural products under mass customization

Engineering Applications of Artificial Intelligence
Automatic component abstraction for Model-Based Diagnosis on relational models

AI Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the tree-of-BDDs approach, a decomposition scheme for compiling configuration problems. Methods for minimum explanations and full interchangeable value sets detection are also given. Experiments show that the techniques presented here can drastically reduce the time and space requirements for interactive configurators.