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

Authors:
Jérôme Amilhastre;Hélène Fargier;Pierre Marquis
Affiliations:
Access Commerce, Labege Cedex, France;Institut de Recherche en Informatique de Toulouse, France;Centre de Recherche en Informatique de Lens, France
Venue:
Artificial Intelligence
Year:
2002

Citing 24
Cited 43

An assumption-based TMS

Artificial Intelligence
Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Tree clustering for constraint networks (research note)

Artificial Intelligence
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Arc-consistency for non-binary dynamic CSPs

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Interpretation as abduction

Artificial Intelligence - Special volume on natural language processing
Probabilistic Horn abduction and Bayesian networks

Artificial Intelligence
The complexity of logic-based abduction

Journal of the ACM (JACM)
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
Structure-driven algorithms for truth maintenance

Artificial Intelligence
Compiling constraint satisfaction problems

Artificial Intelligence
Nonmonotonic reasoning: from complexity to algorithms

Annals of Mathematics and Artificial Intelligence
Product Configuration Frameworks-A Survey

IEEE Intelligent Systems
Compiling Knowledge into Decomposable Negation Normal Form

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Constraint-Based Approach to Diagnosing Software Problems in Computer Networks

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Solving Over-Constrained CSPs Using Weighted OBDDs

Over-Constrained Systems
Arc-Consistency in Dynamic CSPs Is No More Prohibitive

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Computation of Prime Implicates and Prime Implicants by a variant of the Davis and Putnam Procedure

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
An overview of knowledge‐based configuration

AI Communications
A survey on knowledge compilation

AI Communications
Tractable cover compilations

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Knowledge compilation using theory prime implicates

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Compilation for critically constrained knowledge bases

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Compiling CSPs into Tree-Driven Automata for Interactive Solving

Constraints
Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming

SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Constraint Solving in Uncertain and Dynamic Environments: A Survey

Constraints
Reformulation of Global Constraints Based on Constraints Checkers

Constraints
A constraint solver for model-based engineering

AI Communications
Solution techniques for the Large Set Covering Problem

Discrete Applied Mathematics
Maintaining constraint-based applications

Proceedings of the 4th international conference on Knowledge capture
Reformulating Table Constraints using Functional Dependencies--An Application to Explanation Generation

Constraints
Optimizing customer's selection for configurable product in B2C e-commerce application

Computers in Industry
Reformulating Positive Table Constraints Using Functional Dependencies

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Relaxations for Compiled Over-Constrained Problems

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
On the use of partially ordered decision graphs for knowledge compilation and quantified Boolean formulae

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A BDD-based polytime algorithm for cost-bounded interactive configuration

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Approximate compilation for embedded model-based reasoning

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Finding diverse and similar solutions in constraint programming

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Interactive configuration with regular string constraints

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Representative explanations for over-constrained problems

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Decompositions of grammar constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
New polynomial classes for logic-based abduction

Journal of Artificial Intelligence Research
Techniques for efficient interactive configuration of distribution networks

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Decision diagrams for the computation of semiring valuations

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Propositional abduction is almost always hard

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Corrective explanation for interactive constraint satisfaction

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
𝒞𝒪𝒞𝒪𝒩ℱ: Conceptual language-based configuration

AI Communications
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
A reformulation-based approach to explanation in constraint satisfaction

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Decomposing global grammar constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
An improved concurrent search algorithm for distributed CSPs

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Reasoning about optimal collections of solutions

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Improvement of intelligent optimization by an experience feedback approach

EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Interleaving solving and elicitation of constraint satisfaction problems based on expected cost

Constraints
The Complexity of Handling Minimal Solutions in Logic-Based Abduction

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Interactive cost configuration over decision diagrams

Journal of Artificial Intelligence Research
An experimental study for the selection of modules and facilities in a mass customization context

Journal of Intelligent Manufacturing
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
Decision diagrams: fast and flexible support for case retrieval and recommendation

ECCBR'06 Proceedings of the 8th European conference on Advances in Case-Based Reasoning
Representing CSPs with set-labeled diagrams: a compilation map

GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
A dynamic constraint satisfaction approach for configuring structural products under mass customization

Engineering Applications of Artificial Intelligence
Some experimental results relevant to the optimization of configuration and planning problems

ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
Maintaining alternative values in constraint-based configuration

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Preserving partial solutions while relaxing constraint networks

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Semiring labelled decision diagrams, revisited: canonicity and spatial efficiency issues

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On lazy and eager interactive reconfiguration

Proceedings of the Eighth International Workshop on Variability Modelling of Software-Intensive Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of the algorithms developed within the Constraint Satisfaction Problem (CSP) framework cannot be used as such to solve interactive decision support problems, like product configuration. Indeed, in such problems, the user is in charge of assigning values to variables. Global consistency maintaining is only one among several functionalities that should be offered by a CSP-based platform in order to help the user in her task; other important functionalities include providing explanations for some user's choices and ways to restore consistency.