An algorithm for intelligent backtracking

Abstract

We have proposed an intelligent backtracking method based on a search proof tree obtained from the connection graph of a Prolog program. Although our method is assured to be safe, i.e., never overlooks a solution path, it only points out the step from which the retrial of an altenative search may succeed. It can not indicate a promising step to return. Therefore further refinement of our intelligent backtracking method would have to consider possibilities of success as well as safe.