Publisher： Springer Publishing Company
ISSN： 0269-2821
Source： Artificial Intelligence Review, Vol.15, Iss.4, 2001-06, pp. : 243-267
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
The Constraint Satisfaction Problem (CSP) is ubiquitous in artificial intelligence. It has a wide applicability, ranging from machine vision and temporal reasoning to planning and logic programming. This paper attempts a systematic and coherent review of the foundations of the techniques for constraint satisfaction. It discusses in detail the fundamental principles and approaches. This includes an initial definition of the constraint satisfaction problem, a graphical means of problem representation, conventional tree search solution techniques, and pre-processing algorithms which are designed to make subsequent tree search significantly easier.
Related content
Access to resources
Recommend
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science, Vol. 288, Iss. 1, 2002-10 ,pp. :
By Habbas Zineb Krajecki Michael Singer Daniel
International Journal of Computational Science and Engineering, Vol. 1, Iss. 2-4, 2006-05 ,pp. :