Abstract
As backtracking search explores paths in its search tree it makes various inferences about the problem. The inferences search computes can be very computationally expensive to compute statically. However, in most backtracking CSP solvers this information is discarded when the search backtracks along the current path.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bacchus, F. (2007). Caching in Backtracking Search. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)