Computing explanations and implications in preference-based configurators

Authors:
Eugene C. Freuder;Chavalit Likitvivatanavong;Manuela Moretti;Francesca Rossi;Richard J. Wallace
Affiliations:
Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland;Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland;Department of Pure and Applied Mathematics, University of Padova, Italy;Department of Pure and Applied Mathematics, University of Padova, Italy;Cork Constraint Computation Centre, Department of Computer Science, University College Cork, Cork, Ireland
Venue:
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Year:
2002

Citing 8
Cited 6

Possibilistic constraint satisfaction problems or “how to handle soft constraints?”

UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Semiring-based constraint satisfaction and optimization

Journal of the ACM (JACM)
Using dependency records to generate design coordination advice in a constraint-based approach to concurrent engineering

Computers in Industry - Special issue: co-operation in manufacturing systems, CIM at work
Consistency restoriation and explanations in dynamic CSPs----application to configuration

Artificial Intelligence
Product Configuration Frameworks-A Survey

IEEE Intelligent Systems
Towards a general ontology of configuration

Artificial Intelligence for Engineering Design, Analysis and Manufacturing
An overview of knowledge‐based configuration

AI Communications
Towards a generic model of configuraton tasks

IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2

An explanation-based tools for debugging constraint satisfaction problems

Applied Soft Computing
Relaxations for Compiled Over-Constrained Problems

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Representative explanations for over-constrained problems

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Review:

The Knowledge Engineering Review
A formal framework for trust policy negotiation in autonomic systems: abduction with soft constraints

ATC'10 Proceedings of the 7th international conference on Autonomic and trusted computing
Integrating CSP decomposition techniques and BDDs for compiling configuration problems

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider configuration problems with preferences rather than just hard constraints, and we analyze and discuss the features that such configurators should have. In particular, these configurators should provide explanations for the current state, implications of a future choice, and also information about the quality of future solutions, all with the aim of guiding the user in the process of making the right choices to obtain a good solution. We then describe our implemented system, which, by taking the soft n-queens problem as an example, shows that it is indeed possible, even in this very general context of preference-based configurators, to automatically compute all the information needed for the desired features. This is done by keeping track of the inferences that are made during the constraint propagation enforcing phases.