Towards a general theory of action and time
Artificial Intelligence
Efficient graph automorphism by vertex partitioning
Artificial Intelligence
Arc and path consistence revisited
Artificial Intelligence
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
Constraint satisfaction algorithms
Computational Intelligence
A general framework for reason maintenance
Artificial Intelligence
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
Fast planning through planning graph analysis
Artificial Intelligence
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
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
Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches
Artificial Intelligence Review
A theoretical evaluation of selected backtracking algorithms
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
Path-consistency: when space misses time
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches
Artificial Intelligence Review
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Dynamic Flexible Constraint Satisfaction
Applied Intelligence
Efficient Handling of Relational Database Combinatorial Queries Using CSPs
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Journal of Artificial Intelligence Research
Finding rough and fuzzy-rough set reducts with SAT
Information Sciences: an International Journal
| Hi-index | 0.00 |
The Constraint Satisfaction Problem (CSP) is ubiquitous in artificialintelligence. It has a wide applicability, ranging from machine visionand temporal reasoning to planning and logic programming. This paperattempts a systematic and coherent review of the foundations ofthe techniques for constraint satisfaction. It discusses in detail thefundamental principles and approaches. This includes an initialdefinition of the constraint satisfaction problem, a graphical meansof problem representation, conventional tree search solutiontechniques, and pre-processing algorithms which are designed to makesubsequent tree search significantly easier.