Dynamic Backtracking
<|reference_start|>Dynamic Backtracking: Because of their occasional need to return to shallow points in a search tree, existing backtracking methods can sometimes erase meaningful progress toward solving a search problem. In this paper, we present a method by which backtrack points can be moved deeper in the search space, thereby avoiding this difficulty. The technique developed is a variant of dependency-directed backtracking that uses only polynomial space while still providing useful control information and retaining the completeness guarantees provided by earlier approaches.<|reference_end|>
@article{ginsberg1993dynamic,
    title={Dynamic Backtracking},
    author={M. L. Ginsberg},
    journal={Journal of Artificial Intelligence Research, Vol 1, (1993), 25-46},
    year={1993},
    archivePrefix={arXiv},
    eprint={cs/9308101},
    primaryClass={cs.AI}
}