Making compromises among antagonist constraints in a planner
Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Constraint satisfaction algorithms
Computational Intelligence
Partial constraint satisfaction
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
In search of the best constraint satisfaction search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Backtrack programming techniques
Communications of the ACM
Solution Techniques for Constraint Satisfaction Problems: Foundations
Artificial Intelligence Review
Graph Algorithms
FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
Uncertainty in Constraint Satisfaction Problems: a Probalistic Approach
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
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
Approximate resolution of hard numbering problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
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
Solution Techniques for Constraint Satisfaction Problems: Foundations
Artificial Intelligence Review
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
Journal of Artificial Intelligence Research
A global constraint for nesting problems
Artificial Intelligence Review
Flexible goal recognition via graph construction and analysis
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Review: learning bayesian networks: Approaches and issues
The Knowledge Engineering Review
| Hi-index | 0.00 |
Conventional techniques for the constraint satisfaction problem (CSP)have had considerable success in their applications. However,there are many areas in which the performance of the basic approachesmay be improved. These include heuristic ordering of certain tasksperformed by the CSP solver, hybrids which combine compatible solutiontechniques and graph based methods which exploit the structure of theconstraint graph representation of a CSP. Also, conventionalconstraint satisfaction techniques only address problems with hardconstraints (i.e. each of which are completely satisfied or completelyviolated, and all of which must be satisfied by a validsolution). Many real applications require a more flexible approachwhich relaxes somewhat these rigid requirements. To address theseissues various approaches have been developed. This paper attempts asystematic review of them.