Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Model Construction with External Constraints: An Interactive Journey from Semantics to Syntax
MoDELS '08 Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems
Techniques for efficient interactive configuration of distribution networks
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
How to Complete an Interactive Configuration Process?
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Product and Production Process Modeling and Configuration
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying constraint satisfaction problems: modular recursive constraint systems of unbounded size. A precomputation step is used to obtain a configuration algorithm for such systems that supports the user efficiently with bounded response time. This precomputation step determines all solutions for each module, which are computed and stored in compact data structures such as Binary Decision Diagrams (BDDs), in order to eliminate run-time search. The precomputation step also detects ill-behaved module collections that have no finite solutions. The runtime interaction algorithm scales well as its response time only depends on the amount of the information passed locally between the modules, and not on the size of the entire configured structure. Our algorithm was implemented and tested on an industrial example, and gives good response times. We believe this is the first known sound and complete algorithm for solving unbounded interactive configuration problems, with bounded response time per interaction.