Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Generic semantics of feature diagrams
Computer Networks: The International Journal of Computer and Telecommunications Networking
Feature Diagrams and Logics: There and Back Again
SPLC '07 Proceedings of the 11th International Software Product Line Conference
Finding diverse and similar solutions in constraint programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
How to Complete an Interactive Configuration Process?
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
SAT-based analysis of feature models is easy
Proceedings of the 13th International Software Product Line Conference
Automated diagnosis of feature model configurations
Journal of Systems and Software
A compact and efficient SAT-encoding of finite domain CSP
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Managing SAT inconsistencies with HUMUS
Proceedings of the Sixth International Workshop on Variability Modeling of Software-Intensive Systems
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Efficient synthesis of feature models
Proceedings of the 16th International Software Product Line Conference - Volume 1
On computing minimal equivalent subformulas
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Minimal sets over monotone predicates in boolean formulae
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
On computing minimal correction subsets
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
An interactive configuration tool needs to provide feedback to the user on possible further decisions while respecting constraints of the product being configured. In the presence of a large number of product features, it reduces the configuration effort if users can start from a default configuration and adapt only those features that are important to them. Hence, rather than completing an empty configuration (empty product), it is easier to move from one complete configuration to another (from one product to another). This paper shows how to provide tool support for this approach to interactive configuration. Two types of algorithms, based on recent advancements in SAT technology, are introduced: lazy and eager. While the eager provides more information to the user, the lazy scales to configuration models with tens of thousands of features. This is confirmed by an experimental evaluation carried out with the implemented prototype.