Abstract
The choice of the variable to flip in the Walksat family procedures is always random in that it is selected from a randomly chosen unsatisfied clause c. This choice in Novelty or R-Novelty heuristics also contains some determinism in that the variable to flip is always limited to the two best variables in c. In this paper, we first propose a diversification parameter for Novelty (or R-Novelty) heuristic to break the determinism in Novelty and show its performance compared with the random walk parameter in Novelty+. Then we exploit promising decreasing paths in a deterministic fashion in local search using a gradient-based approach. In other words, when promising decreasing paths exist, the variable to flip is no longer selected from a randomly chosen unsatisfied clause but in a deterministic fashion to surely decrease the number of unsatisfied clauses. Experimental results show that the proposed diversification and the determinism allow to significantly improve Novelty (and Walksat).
This work is partially supported by Programme de Recherches Avancées de Cooparations Franco-Chinoises (PRA SI02-04) and project Tolérant (Bestfit) under the research program HTSC of the Picardie region in France.
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.
References
Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of 3rd Annual ACM Symp. Theory of Computing, pp. 151–158 (1971)
Fukunaga, A.: Efficient implementation of sat local search. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 306–320. Springer, Heidelberg (2005)
Gent, I., Walsh, T.: Towards an understanding of hill-climbing procedures for SAT. In: Proceedings of AAAI 1993 (1993)
Hirsch, E.A., Kojevnikov, A.: Unitwalk: A new sat solver that uses local search guided by unit clause elimination. Annals of Mathematics and Artificial Intelligence 43(1-4), 91–111 (2005)
Hoos, H.: On the run-time behavior of stochastic local search algorithms for sat. In: Proceedings of AAAI 1999, pp. 661–666 (1999)
Hoos, H.: An adaptive noise mechanism for walksat. In: Proceedings of AAAI 2002, pp. 655–660. AAAI Press/The MIT Press (2002)
Huang, W.Q., Chao, J.R.: Solar: a learning from human algorithm for solving sat. Science in China (Series E) 27(2), 179–186 (1997)
Li, C.M., Anbulagan, A.: Look-Ahead Versus Look-Back for Satisfiability Problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 342–356. Springer, Heidelberg (1997)
Mazure, B., Saïs, L., Grégoire, É.: Tabu Search for SAT. In: Proceedings of AAAI 1997 (1997)
McAllester, D.A., Selman, B., Kautz, H.: Evidence for invariant in local search. In: Proceedings of AAAI 1997, pp. 321–326 (1997)
Schuurmans, D., Southey, F.: Local search characteristics of incomplete sat procedures. Artificial Intelligence 132(2), 121–150 (2001)
Selman, B., Kautz, H.: Domain-independent extensions to gsat: Solving large structured satisfiability problems. In: Proceedings of IJCAI 1993 (1993)
Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of AAAI 1994, 12th National Conference on Artificial Intelligence, pp. 337–343. AAAI Press, Seattle (1994)
Selman, B., Mitchell, D., Levesque, H.: A new Method for Solving Hard Satisfiability Problems. In: Proceedings of AAAI 1992, pp. 440–446 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, C.M., Huang, W.Q. (2005). Diversification and Determinism in Local Search for Satisfiability. In: Bacchus, F., Walsh, T. (eds) Theory and Applications of Satisfiability Testing. SAT 2005. Lecture Notes in Computer Science, vol 3569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499107_12
Download citation
DOI: https://doi.org/10.1007/11499107_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26276-3
Online ISBN: 978-3-540-31679-4
eBook Packages: Computer ScienceComputer Science (R0)