Abstract
The paper at hand presents a novel and generic approach on how to combine a SLS and a DPLL solver to create an incomplete hybrid SAT solver. In our approach, the SLS solver gets supported by a DPLL solver to boost its performance. In order to develop the idea behind our approach, we first define the term of a search space partition (SSP) and explain its construction and use. For testing our new approach, which utilizes SSPs, we implemented it in the solver hybridGM, using gNovelty+ and March_ks. After explaining the implementation details, we perform an empirical study on several publicly available benchmarks in order to test the performance of the new hybrid SAT solver. The results indicate a superior performance of hybridGM over gNovelty+, proving our new approach to be worthwhile.
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
Cook, S.: The Complexity of Theorem-Proving Procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, vol. 1, pp. 151–158 (1971)
Crawford, J.M.: Solving satisfiability problems using a combination of systematic and local search. In: Second DIMACS Challenge, Rutgers University, NJ (1993)
The bwGRiD, http://www.bw-grid.de/
Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the ACM 7(3), 201–215 (1960)
Ferris, B., Fröhlich, J.: WalkSAT as an Informed Heuristic to DPLL in SAT Solving. Technical report, CSE 573: Artificial Intelligence (2004)
Fang, H., Ruml, W.: Complete Local Search for Propositional Satisfiability. In: Association for the Advancement of Artificial Intelligence (AAAI 2004), pp. 161–166 (2004)
Fang, L., Hsiao, M.: A New Hybrid Solution to Boost SAT Solver Performance. In: Design, Automation, and Test in Europe, pp. 1307–1313 (2007)
Gableske, O.: Towards the Development of a Hybrid SAT Solver. Diploma Thesis, University of Ulm, Germany (January 2009), http://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.inst.190/Mitarbeiter/gableske/DA.pdf
Habet, D., Li, C.M., Devendeville, L., Vasquez, M.: A Hybrid Approach for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 172–184. Springer, Heidelberg (2002)
Havens, W., Dilkina, B.: A Hybrid Schema for Systematic Local Search. In: Tawfik, A.Y., Goodwin, S.D. (eds.) Canadian AI 2004. LNCS, vol. 3060, pp. 248–260. Springer, Heidelberg (2004)
Heule, M., van Maaren, H.: Effective incorporation of Double Look-Ahead Procedures. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 258–271. Springer, Heidelberg (2007)
Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of AAAI 2002, pp. 635–660 (2002)
Hutter, F., Tompkins, D.A., Hoos, H.H.: Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 233–248. Springer, Heidelberg (2002)
Jussien, N., Lhomme, O.: Local Search With Constraint Propagation and Conflict-Based Heuristics. In: 7th National Conference on Artificial Intelligence, pp. 169–174 (2002)
Letombe, F., Marques-Silva, J.: Improvements to hybrid incremental SAT algorithms. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 168–181. Springer, Heidelberg (2008)
Li, C.M., Huang, W.Q.: Diversification and determinism in local search for satisfiability. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 158–172. Springer, Heidelberg (2005)
Mazure, B., Sais, L., Gregoire, E.: Boosting complete techniques thanks to local search methods. Annals of Mathematics and Artificial Intelligence 22, 319–331 (1998)
Pham, D.N., Thornton, J.R., Gretton, C., Sattar, A.: Advances in Local Search for Satisfiability. In: Australian Conference on Artificial Intelligence 2007, pp. 213–222 (2007)
Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 440–446. AAAI Press, Menlo Park (1992)
The SAT Competition Homepage, http://www.satcompetition.org
The SATLIB Benchmark problems, http://www.cs.ubc.ca/~hoos/SATLIB
Wu, Q., Hsiao, M.S.: A New Simulation-Based Property Checking Algorithm Based on Partitioned Alternative Search Space Traversal. IEEE Transactions on Computers 55(11) (2006)
Zhang, W.: Configuration landscape analysis and backbone local search. Part I: Satisfiability and maximum satisfiability. Artificial Intelligence 158, 1–26 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balint, A., Henn, M., Gableske, O. (2009). A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem. In: Kullmann, O. (eds) Theory and Applications of Satisfiability Testing - SAT 2009. SAT 2009. Lecture Notes in Computer Science, vol 5584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02777-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-02777-2_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02776-5
Online ISBN: 978-3-642-02777-2
eBook Packages: Computer ScienceComputer Science (R0)