Constraint Satisfaction Problems: An Overview
Pedro Meseguer · AI Communications · 1989
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