动态回溯
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
