A novel approach to combine a SLS- and a DPLL-solver for the satisfiability problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5584 LNCS, Issue , 2009, Pages 284-297

  Balint, Adrian ^a   Henn, Michael ^a   Gableske, Oliver ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EMPIRICAL STUDIES; GENERIC APPROACH; NEW APPROACHES; SAT SOLVERS; SATISFIABILITY PROBLEMS; SEARCH SPACES;

EID: 70350629565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02777-2_28     Document Type: Conference Paper

References (23)

1. 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)
2. Crawford, J.M.: Solving satisfiability problems using a combination of systematic and local search. In: Second DIMACS Challenge, Rutgers University, NJ (1993)
3. The bwGRiD, http://www.bw-grid.de/
4. Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the ACM 7(3), 201-215 (1960)
5. Ferris, B., Fröhlich, J.: WalkSAT as an Informed Heuristic to DPLL in SAT Solving. Technical report, CSE 573: Artificial Intelligence (2004)
6. Fang, H., Ruml, W.: Complete Local Search for Propositional Satisfiability. In: Association for the Advancement of Artificial Intelligence (AAAI 2004), pp. 161-166 (2004)
7. Fang, L., Hsiao, M.: A New Hybrid Solution to Boost SAT Solver Performance. In: Design, Automation, and Test in Europe, pp. 1307-1313 (2007)
8. 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
9. 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)
10. 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)
11. 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)
12. Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of AAAI 2002, pp. 635-660 (2002)
13. Hutter, F., Tompkins, D.A., Hoos, H.H.: Scaling and probabilistic smoothing: Effcient dynamic local search for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 233-248. Springer, Heidelberg (2002)
14. Jussien, N., Lhomme, O.: Local Search With Constraint Propagation and Conflict-Based Heuristics. In: 7th National Conference on Artificial Intelligence, pp. 169-174 (2002)
15. 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)
16. 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)
17. Mazure, B., Sais, L., Gregoire, E.: Boostingcomplete techniques thanks tolocal search methods. Annals of Mathematics and Artificial Intelligence 22, 319-331 (1998)
18. 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)
19. 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)
20. The SAT Competition Homepage, http://www.satcompetition.org
21. The SATLIB Benchmark problems, http://www.cs.ubc.ca/~hoos/SATLIB
22. 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)
23. Zhang, W.: Configuration landscape analysis and backbone local search. Part I: Satisfiability and maximum satisfiability. Artificial Intelligence 158, 1-26 (2004)