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.