New methods for 3-SAT decision and worst-case analysis

Theoretical Computer Science

Volumn 223, Issue 1-2, 1999, Pages 1-72

  Kullmann, O ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

3 SAT; Analysis of algorithms; Blocked clauses; Extended resolution; Generalized Autarkness; Worst case upper bounds

Indexed keywords

EID: 0010632404     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00017-6     Document Type: Review

References (33)

1. n): a no-MIS algorithm, in: 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 444-452.
2. R. Beigel, R. Floyd, The Language of Machines: An Introduction of Computability and Formal Languages, Computer Science Press, New York, 1993.
3. E. Dantsin, Two systems for proving tautologies, based on the split method, J. Sov. Math. 22 (1983) 1293-1305.
4. M. Davis, G. Logemann, D. Loveland, A machine program for theorem-proving, Comm. ACM 5 (1962) 394-397.
5. M. Davis, H. Putnam, A computing procedure for quantification theory, J. ACM 7 (1960) 201-215.
6. D. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35, American Mathematical Society, Providence, RI, 1997.
7. J. Franco, G. Gallo, H. Büning, E. Speckenmeyer, C. Spera, (Eds.), Workshop on the Satisfiability Problem, Universität zu Köln, Report No. 96-230, Siena, April 29-May 3 1996.
8. A.V. Gelder, A satisfiability tester for non-clausal propositional calculus, Inform. and Comput. 79 (1988) 1-21.
9. A.V. Gelder, Propositional search with k-clause introduction can be polynomially simulated by resolution, in: 5th Internat. Symp. on Artificial Intelligence and Mathematics, January 1998.
10. A.V. Gelder, Y.K. Tsuji, Satisfiability testing with more reasoning and less guessing, in: D.S. Johnson, M. Trick, (Eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, Providence, RI, 1996, pp. 559-586.
11. J. Gu, P.W. Purdom, J. Franco, B.W. Wah, Algorithms for the satisfiability (SAT) problem: A survey, in: D. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35, American Mathematical Society, Providence, RI, 1997.
12. E. Hirsch, Two new upper bounds for SAT, Proc. SODA'98, to appear.
13. J.N. Hooker, V. Vinay, Branching rules for satisfiability, J. Autom. Reasoning 15 (1995) 359-383.
14. H.B. Hunt, R.E. Stearns, Power indices and easier hard problems, Math. Systems Theory 23 (1990) 209-225.
15. J. Krajíček, Bounded Arithmetic, Propositional Logic, and Complexity Theory, Cambridge University Press, Cambridge, 1995.
16. 0.59·n steps, Bull. Symbol. Logic 1 (1) (1995) 96-97. Abstracts of contributed papers of the Logic Colloquium' 93, Keele, England, July 20-29, 1993.
17. O. Kullmann, A note on a generlization of extended resolution, in: [7, pp. 73-95]. Revised: [18].
18. O. Kullmann, On a generalization of extended resolution, Discrete Appl. Math., submitted (special edition on the satisfiability problem); revised version of [17], 1996.
19. O. Kullmann, Heuristics for SAT algorithms: A systematic study. SAT'98, Second Workshop on the Satisfiability Problem, May 10-14, 1998, Eringerfeld, Germany.
20. O. Kullmann, Worst-case analysis, 3-SAT decision and lower bounds: approaches for improved SAT algorithms, in: D. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability Problem: Theory and Applications (DIMACS Workshop March 11-13, 1996), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35, American Mathematical Society, Providence, RI, 1997, pp. 261-313.
21. O. Kullmann, The combination of extended resolution and DPLL-algorithms, forthcoming.
22. O. Kullmann, H. Luckhardt, Deciding propositional tautologies: algorithms and their complexity, Inform. and Comput. submitted.
23. H. Luckhardt, Obere Komplexitätsschranken für TAUT-Entscheidungen, in: Frege Conf. 1984, Schwerin, Akademie-Verlag, Berlin, 1984, pp. 331-337.
24. r) steps, Technical Report Bericht Nr. 3/1979, Universität-Gesamthochschule-Paderborn, 1979, Reihe Theoretische Informatik.
25. n steps, Discrete Appl. Math. 10 (1985) 287-295.
26. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA; 1994.
27. R. Paturi, P. Pudlak, F. Zane, Satisfiability coding lemma, in: Proc. 38th Annual Symp. Foundations of Computer Science (FOCS 97), 1997, pp. 566-574.
28. P.W. Purdom, Solving satisfiability with less searching, IEEE Trans. Pattern Anal. Machine Intell. 6 (4) (1984) 510-513.
29. n steps, in: Selected paper from Computer Science Logic '92, Lecture Notes Computer Science, vol. 702, Springer, Berlin, 1992, pp. 379-394.
30. n) 3-satisfiability algorithm, in: [7, pp. 127-136]. Siena, April 29-May 3 (1996).
31. G.M.N. Stalmarck, Method and apparatus for checking propositional logic theorems in system analysis, 1990, European Patent Specification; application: December 19, 1990, Bulletin 90/51; publication: June 28, 1995, Bulletin 95/26.
32. G.S. Tseitin, On the complexity of derivation in propositional calculus, in: Seminars in Mathematics. V.A. Steklov Mathematical Institute, Leningrad, vol. 8, 1968. (English translation 1970; A.O. Slisenko (Ed.))
33. W. Zhang, Number of models and satisfiability of sets of clauses, Theoret. Comput. Sci. 155 (1996) 277-288.