The Advantages of the Weak-commitment Search
NTT Communication Science Labs.
A mistake can be revised without conducting an exhaustive search.
The tentative initial values can gradually move closer to the final solution after each restart.
The theoretical completeness can be guaranteed (the abandoned partial solution will not be constructed again).
Heuristics that presuppose the existence of consistent partial solutions can be introduced.