Abstract
Recently, it has been found that the cost distributions of randomized backtrack search in combinatorial domains are often heavytailed. Such heavy-tailed distributions explain the high variability observed when using backtrack-style procedures. A good understanding of this phenomenon can lead to better search techniques. For example, restart strategies provide a good mechanism for eliminating the heavytailed behavior and boosting the overall search performance. Several state-of-the-art SAT solvers now incorporate such restart mechanisms. The study of heavy-tailed phenomena in combinatorial search has so far been been largely based on empirical data. We introduce several abstract tree search models, and show formally how heavy-tailed cost distribution can arise in backtrack search. We also discuss how these insights may facilitate the development of better combinatorial search methods.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Bayardo and R. Schrag. Using csp look-back techniques to solve real-world sat instances. In Proc. of the 14th Natl. Conf. on Arti.cial Intelligence (AAAI-97), pages 203–208, New Providence, RI, 1997. AAAI Press.
J. M. Crawford, M. J. Kearns, and R. E. Schapire. The minimal disagreement parity problem as a hard satisfiability problem. Technical report (also in dimacs sat benchmark), CIRL, 1994.
C. Gomes, B. Selman, and N. Crato. Heavy-tailed Distributions in Combinatorial Search. In G. Smolka, editor, Princp. and practice of Constraint Programming (CP97). Lect. Notes in Comp. Sci., pages 121–135. Springer-Verlag, 1997.
C. Gomes, B. Selman, and H. Kautz. Boosting Combinatorial Search Through Randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), pages 431–438, New Providence, RI, 1998. AAAI Press.
C. P. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. of Automated Reasoning, 24(1–2):67–100, 2000.
M. Harchol-Balter, M. Crovella, and C. Murta. On choosing a task assignment policy for a distributed server system. In Proceedings of Performance Tools’ 98, pages 231–242. Springer-Verlag, 1998.
I. Jacobs and E. Berlekamp. A lower bound to the distribution of computation for sequential decoding. IEEE Trans. Inform. Theory, pages 167–174, 1963.
C. M. Li. A constrained-based approach to narrow search trees for satisfiability. Information processing letters, 71:75–80, 1999.
C. M. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 366–371. AAAI Pess, 1997.
M. Luby, A. Sinclair, and D. Zuckerman. Optimal speedup of las vegas algorithms. Information Process. Letters, pages 173–180, 1993.
J. P. Marques-Silva and K. A. Sakallah. Grasp-a search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506–521, 1999.
M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. In Proc. of the 39th Design Automation Conf., 2001.
T. Walsh. Search in a small world. In IJCAI-99, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, H., Gomes, C., Selman, B. (2001). Formal Models of Heavy-Tailed Behavior in Combinatorial Search. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_28
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive