Programming pearl - Enhancing a search algorithm to perform intelligent backtracking
This paper illustrates how a Prolog program, using chronological backtracking to find a solution in some search space, can be enhanced to perforin intelligent backtracking. The enhancement crucially relics on the impurity of Prolog that allows a program to store information when a dead end is reached. To illustrate the technique, a simple search program is enhanced.
intelligent backtracking dependency-directed backtracking backjumping conflict-directed backjuniping nogood sets look-back