Dynamic Backtracking

Simple item page
dc.creatorGinsberg, M. L.
dc.date1993-08-01
dc.date.accessioned2026-07-07T09:12:17Z
dc.date.available2026-07-07T09:12:17Z
dc.descriptionBecause 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.
dc.descriptionSee http://www.jair.org/ for an online appendix and other files accompanying this article
dc.identifierhttps://arxiv.org/abs/cs/9308101
dc.identifierhttp://arxiv.org/abs/cs/9308101
dc.identifierJournal of Artificial Intelligence Research, Vol 1, (1993), 25-46
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151971
dc.subjectArtificial Intelligence
dc.titleDynamic Backtracking
dc.typetext

Files

Collections

arXiv