Deterministic algorithms for k-SAT based on covering codes and local search

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

Volumn 1853, Issue , 2000, Pages 236-247

  Dantsin, Evgeny ^a   Goerdt, Andreas ^b   Hirsch, Edward A ^a   Schöning, Uwe ^c  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; LOCAL SEARCH (OPTIMIZATION);

COVERING CODES; DETERMINISTIC ALGORITHMS; LOCAL SEARCH; PROBABILISTIC ALGORITHM; SAT-BASED; SATISFIABILITY; TECHNICAL EFFORTS; UPPER BOUND;

ROBOTS;

EID: 84974604587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_21     Document Type: Conference Paper

References (16)

1. R. B. Ash. Information Theory. Dover, 1965.
2. L. Bolc and J. Cytowski. Search Methods for Artificial Intelligence. Academic Press, 1992.
3. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein. Covering Codes, volume 54 of Mathematical Library. Elsevier, 1997.
4. E. Dantsin. Two propositional proof systems based on the splitting method (in Russian). Zapiski Nauchnykh Seminarov LOMI, 105:24-44, 1981. English translation: Journal of Soviet Mathematics, 22(3):1293-1305, 1983.
5. E. A. Hirsch. Two new upper bounds for SAT. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’98, pages 521-530, 1998. A journal version is to appear in Journal of Automated Reasoning, 2000.
6. O. Kullmann. Worst-case analysis, 3-SAT decision and lower bounds: approaches for improved SAT algorithms. In D. Du, J. Gu, and P. M. Pardalos, editors, Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11- 13, 1996), volume 35 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 261-313. AMS, 1997.
7. O. Kullmann. New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science, 223(1-2):1-72, 1999.
8. O. Kullmann and H. Luckhardt. Deciding propositional tautologies: Algorithms and their complexity. Preprint, 82 pages, http://www.cs.toronto.edu/~kullmann. A journal version is submitted to Information and Computation, January 1997.
9. S. Minton, M. D. Johnston, A. B. Philips, and P. Lair. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161-205, 1992.
10. n steps. Discrete Applied Mathematics, 10:287-295, 1985.
11. C. H. Papadimitriou. On selecting a satisfying truth assignment. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS’91, pages 163-169, 1991.
12. R. Paturi, P. Pudlák, M. E. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS’98, pages 628-637, 1998.
13. R. Paturi, P. Pudlák, and F. Zane. Satisfiability coding lemma. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS’97, pages 566-574, 1997.
14. n) 3-satisfiability algorithm. Workshop on the Satisfiability Problem, Siena, April 29 - May 3, 1996. Technical Report 96-230, University Köln, 1996.
15. U. Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, FOCS’99, pages 410-414, 1999.
16. W. Zhang. Number of models and satisfiability of sets of clauses. Theoretical Computer Science, 155:277-288, 1996.