Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Introduction to Algorithms
Constraint Processing
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Approximate Compilation of Constraints into Multivalued Decision Diagrams
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A BDD Approach to the Feature Subscription Problem
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Techniques for efficient interactive configuration of distribution networks
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
AND/OR multi-valued decision diagrams for constraint optimization
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be conveniently formulated as a Constraint Satisfaction Problem where the constraints are propositional formulas. The problem of interactive configuration was originally inspired by the product configuration problem with the emergence of the masscustomization paradigm in product manufacturing, but has also been applied to other tasks requiring user interaction, such as specifying services or setting up complex equipment. The user-friendly requirements of complete, backtrack-free and real-time interaction makes the problem computationally challenging. Therefore, it is beneficial to compile the configuration constraints into a tractable representation such as Binary Decision Diagrams (BOD) (Bryant 1986) to support efficient user interaction. The compilation deals with the NP-hardness such that the online interaction is in polynomial time in the size of the BOD. In this paper we address the problem of extending configurators so that a user can interactively limit configuration choices based on a maximum cost (such as price or weight of a product) of any valid configuration, in a complete, backtrack-free and real-time manner. The current BOD compilation approach is not adequate for this purpose, since adding the total cost information to the constraints description can dramatically increase the size of the compiled BOD. We show how to extend this compilation approach to solve the problem while keeping the polynomial time guarantees.