… artifact of chronological backtracking that does not apply to the more advanced algorithms. …
intelligent backtracking algorithm that has been of much interest: dynamic backtracking. We …

… one with a better backtracking behaviour. His method looks … avoids simple dif&ulties for the
backtracking, the effort to de&t … in this paper improves the backtracking behaviour at the cost …

… Intelligent backtracking is a technique used for reducing search during the execution of
backtracking … In this paper we describe an intelligent backtracking approach for binary linear …

… algonthm" is generally assumed to be a chronological backtracker (BT, BM, FC), or the …
backtracker). Conversely, we should expect that we can improve the performance of an intelligent …

… Our technique is based on intelligent backtracking. An adaptation of a generic explanation
system we have initially developed in the constraint programming scheme is used to develop …

… intelligent backtracking algorithms such as backjumping and dependencydirected backtracking…
underconstrained problems that are the hardest for backtracking, but are of less value on …

This paper develops a method of mechanical deduction based on a graphical representation
of the structure of proofs. Attempts to find a refutation(s) are recorded in the form of plans, …

… A popular method for solving these types of problems consists in using depth-first backtrack
search… More specifically, we successively describe three intelligent backtracking schemes: Dy…

… To this end, I consider all backtracking and learning algorithms within the context of general
… I argue that intelligent backtracking is best understood as “explanation directed backtracking…

… intelligent backtracking in Horn-clause logic programs. The scheme is simple and yet
effective for backtracking … -backtracking even more intelligent and also to perform across-the-clause …