一种基于修改的约束满足算法

求解约束满足问题的修改算法从实始的有冲突的完整解出发，不断修改理有的变量赋值，从而得到无冲突的完整解。本文将启发式方法应用了修改型算法，提出了一种高效的基于修改的约束满足算法。

A REPAIR BASED ALGORITHM FOR CONSTRAINT SATISFACTION

The repair based method for solving constraint satisfaction problems starts from the initial solution with conflicts, keeps repairing the current assignments, and finally gets the solution without conflicts. This method has an advantage over the constructive one,with which the solution is obtained through incrementally extending consistent partial assignments in the usage of the information provided by the current assignments.But the constructive method can improve efficiency with various powerful heuristics developed in many years. In this paper, an efficient repair based algorithm for constraint satisfaction problem is developed through the application of heuristics.