Artificial Intelligence
Arc and path consistence revisited
Artificial Intelligence
Computer vision: a first course
Computer vision: a first course
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Comments on Mohr and Henderson's path consistency algorithm
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
An optimal k-consistency algorithm
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
A general framework for reason maintenance
Artificial Intelligence
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Possibilistic constraint satisfaction problems or “how to handle soft constraints?”
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Solution reuse in dynamic constraint satisfaction problems
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The hazards of fancy backtracking
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Arc-consistency and arc-consistency again
Artificial Intelligence
Qualitative reasoning: modeling and simulation with incomplete knowledge
Qualitative reasoning: modeling and simulation with incomplete knowledge
Refinements of the maximin approach to decision-making in a fuzzy environment
Fuzzy Sets and Systems - Special issue on fuzzy optimization
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Synthesizing constraint expressions
Communications of the ACM
Backtrack programming techniques
Communications of the ACM
Nonserial Dynamic Programming
FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
Extending Constraint Satisfaction Problem Solving in Structural Design
IEA/AIE '92 Proceedings of the 5th international conference on Industrial and engineering applications of artificial intelligence and expert systems
A theoretical evaluation of selected backtracking algorithms
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Look-ahead value ordering for constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Using inference to reduce arc consistency computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial 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
Using branch-and-bound with constraint satisfaction in optimization problems
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Enhancements of branch and bound methods for the maximal constraint satisfaction problem
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
The Knowledge Engineering Review
A nurse scheduling system based on dynamic constraint satisfaction problem
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Journal of Artificial Intelligence Research
Using multiobjective evolutionary algorithms to assess biological simulation models
EMO'07 Proceedings of the 4th international conference on Evolutionary multi-criterion optimization
Hi-index | 0.00 |
Constraint satisfaction is a fundamental artificial intelligence technique offering a simple yet powerful representation. An increasing amount of attention has recently been paid to the development of constraint satisfaction techniques, and it has become clear that the original formulation of a static Constraint Satisfaction Problem (CSP) with hard, imperative constraints is insufficient to model many real problems. Two important extensions to the classical CSP framework which address some of these deficiencies are flexible and dynamic constraint satisfaction. This paper examines in detail classical, flexible and dynamic CSP. It reviews the motivations behind both extensions, and describes the techniques used to solve each type of problem. The paper employs a running example throughout to illustrate the ideas presented.