Abstract
Experimental results are given on the scaling of the Pure Random Walk version (PRWSAT) of WalkSAT. PRWSAT is very simple because of the absence of heuristics: not only the clause is selected at random, but also the literal within that clause. The main result is that, despite the simplicity and absence of heuristics, it has non-trivial behavior on Random 3-SAT. There appears to be a threshold at a clause/variable ratio of about 2.65. Below the threshold, problems are solved in a tightly-distributed and linear number of flips. Above the threshold scaling appears to be non-polynomial. The simplicity and the nontrivial threshold make it a good candidate for theoretical analysis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kirkpatrick, S., Selman, B.: Critical behavior in the satisfiability of random boolean expressions. Science 264 (1994) 1297–1301
Friedgut, E.: Sharp thresholds of graph properties, and the k-SAT problem. Journal of the American Mathematical Society 12 (1999) 1017–1054
Goerdt: A remark on random 2-SAT. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 96 (1999)
Crawford, J.M., Auton, L.D.: Experimental results on the crossover point in random 3-SAT. Artificial Intelligence 81 (1996) 31–57
Achlioptas, D., Sorkin, G.B.: Optimal myopic algorithms for random 3-SAT. In: IEEE Symposium on Foundations of Computer Science (FOCS 00). (2000) 590–600
Selman, B., Kautz, H., Cohen, B.:Local search strategies for satisfiability testing. In Johnson, D. S., Trick, M. A., eds.: Cliques, Coloring and Satisfiability, American Mathematical Society (1996) 521–531
Broder, A.Z., Frieze, A.M., Upfal, E.: On the satisability and maximum satisability of random 3-CNF formulas. In: Proc. 4th Ann. ACM-SIAM SODA. (1993) 322–330
Hirsch, E. A.: SAT local search algorithms: Worst-case study. Journal of Automated Reasoning 24 (2000) 127–143
Papadimitriou, C.: On selecting a satisfying truth assignment. In: Proc. IEEE symposium on Foundations of Computer Science. (1991) 163–169
Parkes, A. J.: Easy predictions for the easy-hard-easy transition. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002). (2002)
Parkes, A. J., Walser, J.P.: Tuning Local Search for Satisfiability Testing. In: Proceedings of AAAI-96, Portland, OR (1996) 356–362
Ben-Sasson, E.: Personal communication (2002)
Parkes, A. J.: Distributed local search, phase transitions, and polylog time. In: Proc. “Stochastic Search Algorithms” workshop, IJCAI-01”. (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parkes, A.J. (2002). Scaling Properties of Pure Random Walk on Random 3-SAT. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_50
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive