Abstract
In this paper we discuss search heuristics for non-clausal stochastic local search procedures for propositional satisfiability. These heuristics are based on a new method for variable selection as well as a novel clause learning technique for dynamic input formula simplification as well as for guiding the search for a model.
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
Achlioptas, D., Jia, H., Moore, C.: Hiding Satisfying Assignments: Two are Better than One. J. of Artificial Intelligence Research 24, 623–639 (2005)
Crawford, J.M., Kearns, M.J., Shapire, R.E.: The Minimal Disagreement Parity Problem as Hard Satisfiability Problem. Computational Intell. Research Lab and AT&T Bell Labs TR (1994)
Fang, H., Ruml, W.: Complete Local Search for Propositional Satisfiability. In: AAAI, pp. 161–166 (2004)
Hoos, H.H.: Local Search – Methods, Models, Applications. TU Dermstadt, FB Informatik, Darmstadt, Germany (1998)
Hoos, H.H.: On the Run-Time Behavior of Stochastic Local Search Algorithms for SAT. In: AAAI/IAAI, pp. 661–666 (1999)
Hoos, H.H.: An Adaptive Noise Mechanism for WalkSAT. In: AAAI, pp. 655–660 (2002)
Hoos, H.H., Stutzle, T.: Local Search Algorithms for SAT: An Empirical Evaluation. Journal of Automated Reasoning 24, 421–481 (2000)
Hoos, H.H., Stutzle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, Amsterdam (2005)
Kautz, H., Selman, B., McAllester, D.: Exploiting Variable Dependency in Local Search. In: IJCAI (1997)
Lynce, I., Marques-Silva, J.P.: An Overview of Backtrack Search Satisfiability Algorithms. Annals of Mathematics and Artificial Intelligence, 307–326 (2003)
McAllester, D., Selman, B., Kautz, H.: Evidence for Invariants in Local Search. In: AAAI, pp. 321–326 (1997)
Navarro, J.A., Voronkov, A.: Generation of Hard Non-Clausal Random Satisfiability Problems. In: AAAI, pp. 436–442 (2005)
Prestwich, S.D.: Variable Dependency in Local Search: Prevention Is Better Than Cure. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 107–120. Springer, Heidelberg (2007)
Stachniak, Z.: Going Non-clausal. In: SAT, pp. 316–322 (2002)
Tompkins, D.A., Hoos, H.: UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 306–320. Springer, Heidelberg (2005)
Velev, M.: Miroslav Velev’s SAT Benchmarks, http://www.miroslav-velev.com/sat_benchmarks.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stachniak, Z., Belov, A. (2008). Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning. In: Kleine Büning, H., Zhao, X. (eds) Theory and Applications of Satisfiability Testing – SAT 2008. SAT 2008. Lecture Notes in Computer Science, vol 4996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79719-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-79719-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79718-0
Online ISBN: 978-3-540-79719-7
eBook Packages: Computer ScienceComputer Science (R0)