On computing k-CNF formula properties

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

Volumn 2919, Issue , 2004, Pages 330-340

  Williams, Ryan ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LOGIC;

BACKTRACKING SEARCH; CLAUSE LEARNING; EXPONENTIAL TIME ALGORITHM; MAXIMUM SATISFIABILITY; SATISFYING ASSIGNMENTS; SIMPLE ALGORITHM; VARIABLE SELECTION; WORST-CASE PERFORMANCE;

COMPUTATION THEORY;

EID: 35048892848     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_25     Document Type: Article

References (17)

1. N. Bansal and V. Raman. Upper bounds for MaxSat: Further improved. Proc. of the 10th ISAAC, 1999.
2. V. Dahllöf, P. Jonsson, Magnus Wahlstrm. Counting Satisfying Assignments in 2-SAT and 3-SAT. Proc. of COCOON, 535-543, 2002.
3. M. Davis and H. Putnam, A computing procedure for quantification theory. Journal of the ACM, 7(1):201-215, 1960.
4. E. A. Hirsch. New worst-case upper bounds for SAT. Journal of Automated Reasoning, Special Issue II on Satisfiability in Year 2000, 2000. A preliminary version appeared in Proceedings of SODA 98.
5. E. A. Hirsch. Worst-case Time Bounds for MAX-k-SAT with respect to the Number of Variables Using Local Search. ICALP Workshop on Approximation and Randomized Algorithms in Communication Networks, 69-76, 2000.
6. T. Hofmeister, U. Schoening, R. Schuler, O. Watanabe. A probabilistic 3-SAT algorithm further improved. Proc. of STACS, 192-202, 2002.
7. I. Lynce and J. Marques-Silva. Complete unrestricted backtracking algorithms for satisfiability. In Fifth International Symposium on the Theory and Applications of Satisfiability Testing, 2002.
8. r) steps, Bericht Nr. 3/1979, Reihe Theoretische Informatik, Universität-Gesamthochschule-Paderborn.
9. B. Monien and E. Speckenmeyer. Upper bounds for covering problems. Bericht Nr. 7/1980, Reihe Theoretische Informatik, Universität- Gesamthochschule-Paderborn.
10. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. Proc. DAC-01, 2001.
11. R. Paturi, P. Pudlak, and F. Zane. Satisfiability Coding Lemma. Proc. of the 38th IEEE FOCS, 566-574, 1997.
12. R. Paturi, P. Pudlak, M. E. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT. Proc. of the 39th IEEE FOCS, 628-637, 1998.
13. M. Robson. Algorithms for maximum independent sets. Journal of Algorithms, 7(3):425-440, 1986
14. U. Schoening. A probabilistic algorithm for k-SAT and constraint satisfaction problems. Proc. of the 40th IEEE FOCS, 410-414, 1999.
15. B. Selman, H. Kautz, and B. Cohen. Local Search Strategies for Satisfiability Testing. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993.
16. R. Williams. Algorithms for quantified Boolean formulas. Proc. ACM-SIAM SODA, 299-307, 2002.
17. R. Williams, C. Gomes, and B. Selman. Backdoors To Typical Case Complexity. To appear in Proc. of IJCAI, 2003.