Skip to main content
SpringerLink
Log in

Local search algorithms for SAT: Worst-case analysis

  • Conference paper
  • First Online:
Algorithm Theory — SWAT'98 (SWAT 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1432))

Included in the following conference series:

  • 121 Accesses

Abstract

Recent experiments demonstrated that local search algorithms (e.g. GSAT) axe able to find satisfying assignments for many “hard” Boolean formulas. However, no non-trivial worst-case upper bounds were proved, although many such bounds of the form 2itαn (α < 1 is a constant) are known for other SAT algorithms, e.g. resolution-like algorithms. In the present paper we prove such a bound for a local search algorithm, namely for CSAT. The class of formulas we consider covers most of DIMACS benchmarks, the satisfiability problem for this class of formulas is NP-complete.

Supported by INTAS-RFBR project No.95-0095

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dantsin, E.: Tautology proof systems based on the splitting method (in Russian). PhD thesis. Leningrad Division of Steklov Institute of Mathematics (LOMI) (1983)

    Google Scholar 

  2. Dantsin, E., Kreinovich, V.: Exponential upper bounds for the propositional satisfiability problem (in Russian). In: Proceedings of the 9th National Conference on Mathematical Logic. Leningrad (1988) p. 47

    Google Scholar 

  3. Franco, J., Swaminathan, R.: Average case results for satisfiability algorithms under the random clause model. Annals of Mathematics and Artificial Intelligence (to appear)

    Google Scholar 

  4. Garey, M. R., Johnson, D. S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)

    Google Scholar 

  5. Gent, I., Walsh, T.: The Enigma of Hill-climbing Procedures for SAT. Research Paper 605, Department of Artificial Intelligence, University of Edinburgh (1992)

    Google Scholar 

  6. Gent, I., Walsh, T.: Towards an Understanding of Hill-climbing Procedures for SAT. In: Proceedings of 11th National Conference on Artificial Intelligence. Washington, DC, AAAI Press (1993) 28–33

    Google Scholar 

  7. Gent, I., Walsh, T.: Unsatisfied Variables in Local Search. In: Hallam, J. (ed.): Hybrid Problems, Hybrid Solutions (AISB-95). IOS Press, Amsterdam (1995)

    Google Scholar 

  8. Gu, J., Gu, Q.-P.: Average Time Complexity of The SAT1.2 Algorithm. In: Proceedings of the 5th Annual International Symposium on Algorithms and Computation (1994) 147–155

    Google Scholar 

  9. Hirsch, E. A.: Two new upper bounds for SAT. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (1998) 521–530

    Google Scholar 

  10. Koutsoupias, E., Papadimitriou, C. H.: On the greedy algorithm for satisfiability. Information Processing Letters 43(1) (1992) 53–55

    Article  MathSciNet  Google Scholar 

  11. Kullmann, O.: Worst-case Analysis, 3-SAT Decision and Lower Bounds: Approaches for Improved SAT Algorithms. In: Du, D., Gu, J., Pardalos P.M. (eds.): DIMACS Proceedings SAT Workshop 1996. American Mathematical Society (1997)

    Google Scholar 

  12. Luckhardt, H.: Obere KomplexitÄtsschranken für TAUT-Entscheidungen. In: Proceedings of Frege Conference 1984. Schwerine, Akademie-Verlag Berline (1984) 331–337

    Google Scholar 

  13. Monien, B., Speckenmeyer, E.: 3-satisfiability is testable in O(1.62r) steps. Bericht Nr. 3/1979, Reihe Theoretische Informatik, UniversitÄt-Gesamthochschule-Paderborn

    Google Scholar 

  14. Monien, B., Speckenmeyer, E.: Solving satisfiability in less than 2n steps. Discrete Applied Mathematics 10 (1985) 287–295

    Article  MathSciNet  Google Scholar 

  15. Paturi, R., Pudlak, P., Zane, F.: Satisfiability Coding Lemma. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (1997) 566–574

    Google Scholar 

  16. Schiermeyer, I.: Pure literal look ahead: An O(1.497n) 3-Satisfiability algorithm. In: Franco, J., Gallo, G., Kleine Büning, H., Speckenmeyer, E., Spera, C. (eds.): Workshop on the Satisfiability Problem, Technical Report. Siena, April, 29–May, 3, 1996. University Köln, Report No. 96-230

    Google Scholar 

  17. Selman, B., Kautz, H.: An Empirical Study of Greedy Local Search for Satisfiability Testing. In: Proceedings of the 11th Conference on Artificial Intelligence. Washington, DC, AAAI Press (1993)

    Google Scholar 

  18. Selman, B., Kautz, H.: Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In: Proceedings of the 14th Conference on Artificial Intelligence (1996)

    Google Scholar 

  19. Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the 12th Conference on Artificial Intelligence. Seattle, Washington, AAAI Press (1993) 1:337–343

    Google Scholar 

  20. Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Swartout, W. (ed.): Proceedings of the 10th Conference on Artificial Intelligence. San Jose, California, MIT Press (1992) 440–446

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Steklov Institute of Mathematics at St.Petersburg, 27 Fontanka, 191011, St.Petersburg, Russia

    Edward A. Hirsch

Authors
  1. Edward A. Hirsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stefan Arnborg Lars Ivansson

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirsch, E.A. (1998). Local search algorithms for SAT: Worst-case analysis. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054372

Download citation

  • DOI: https://doi.org/10.1007/BFb0054372

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64682-2

  • Online ISBN: 978-3-540-69106-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation