Local search algorithms for SAT: Worst-case analysis

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

Volumn 1432, Issue , 1998, Pages 246-254

  Hirsch, Edward A ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; LEARNING ALGORITHMS; LOCAL SEARCH (OPTIMIZATION);

BOOLEAN FORMULAE; LOCAL SEARCH ALGORITHM; NON-TRIVIAL; NP COMPLETE; SATISFIABILITY PROBLEMS; SATISFYING ASSIGNMENTS; UPPER BOUND; WORST-CASE ANALYSIS;

ALGORITHMS;

EID: 84957711442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054372     Document Type: Conference Paper

References (20)

1. Dantsin, E.: Tautology proof systems based on the splitting method (in Russian). PhD thesis. Leningrad Division of Steklov Institute of Mathematics (LOMI) (1983)
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
3. Franco, J., Swaminathan, R.: Average case results for satisfiability algorithms under the random clause model. Annals of Mathematics and Artificial Intelligence (to appear)
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)
5. Gent, I., Walsh, T.: The Enigma of Hill-climbing Procedures for SAT. Research Paper 605, Department of Artificial Intelligence, University of Edinburgh (1992)
6. Gent, I., Walsh, T.: Towards an Understanding of Hill-climbing Procedures for SAT. In: Proceedings of llth National Conference on Artificial Intelligence. Washington, DC, AAAI Press (1993) 28-33
7. Gent, I., Walsh, T.: Unsatisfied Variables in Local Search. In: Hallam, J. (ed.): Hybrid Problems, Hybrid Solutions (AISB-95). IOS Press, Amsterdam (1995)
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
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
10. Koutsoupias, E., Papadimitriou, C.H.: On the greedy algorithm for satisfiability. Information Processing Letters 43(1) (1992) 53-55
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)
12. Luckhardt, H.: Obere Komplexitätsschranken für TAUT-Entscheidungen. In: Proceedings of Frege Conference 1984. Schwerine, Akademie-Verlag Berline (1984) 331-337
13. Monien, B., Speckenmeyer, E.: 3-satisfiability is testable in O(1.62 r) steps. Bericht Nr. 3/1979, Reihe Theoretische Informatik, Universität-Gesamthochschule-Paderborn
14. Monien, B., Speckenmeyer, E.: Solving satisfiability in less than 2n steps. Discrete Applied Mathematics 10 (1985) 287-295
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
16. Schiermeyer, I.: Pure literal look ahead: An O(1.497n) 3-Satisfiability algorithm. In: Franco, J., Gallo, G., Kleine Brining, H., Speckenmeyer, E., Spera, C. (eds.): Workshop on the Satisfiability Problem, Technical Report. Siena, April, 29-May, 3, 1996. University KSln, Report No. 96-230
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)
18. Selman, B., Kautz, H.: Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In: Proceedings of the 14th Conference on Artificial Intelligence (1996)
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
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