Answers are grounded in this paper and cite their sources.
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
No takes yet. Share an insight, caveat, or question.
Pedro Meseguer (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: