Abstract
Many AI problems can be formulated as Constraint Satisfaction Problems (CSP). Using a systematic search process with backtracking this kind of problems can be solved, but this method is very inefficient. Other methods solving CSP have been developed showing a better performance. In this paper an overview of methods (algorithms and heuristics) solving CSP is presented, stressing the key ideas underlying the different methods.
Get full access to this article
View all access options for this article.