Algorithms for quantified Boolean formulas

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 299-307

  Williams, Ryan ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; CONSTRAINT SATISFACTION PROBLEMS;

CONJUNCTIVE NORMAL FORMS; DOMAIN SIZE; POLYNOMIAL SPACE; POLYSPACE; QUANTIFIED BOOLEAN FORMULAS; RUNTIMES; TIME COMPLEXITY; VARIABLE RATIO;

BOOLEAN ALGEBRA;

EID: 84968813932     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. B. Apswall, M. F. Plass and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters, 8:121-123, 1979.
2. H. K.-Büning, M. Karpinski, and A. Flogel, Resolution for quantified Boolean formulas, Information and Computation, 117(1): 12-18, 1995.
3. M. Cadoli, A. Giovanardi, and M. Schaerf, An algorithm to evaluate quantified Boolean formulae, Proceedings of AAAI-98, pp. 262-267, 1998.
4. J. Chen, I. A. Kanj, and W. Jia, Vertex cover: Further observation and further improvements, Lecture Notes in Computer Science 1665 (WG'99), Springer-Verlag, Berlin, pp. 313-324, 1999.
5. E. Dantsin, A. Goerdt, E. A. Hirsch, R. Kannan, J. Kleinberg, C. Papadimitriou, P. Raghavan, U. Schöning, A deterministic (2 -2/k+1)" algorithm for k-SAT based on local search, Accepted in Theoretical Computer Science, 2001.
6. M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM, 7(1):201-215, 1960.
7. D. Eppstein, Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction, Proceedings of 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 329-337, 2001.
8. I. Gent and T. Walsh, Beyond NP: the QSAT phase transition, Proceedings of AAAI-99, 1999.
9. E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A system for deciding quantified Boolean formulas satisfiability, Proceedings of the Int. Joint Conference on Automated Reasoning, 2001.
10. E. A. Hirsch. New worst-case upper bounds for SAT, Journal of Automated Reasoning, 24(4): 397-420, 2000.
11. O. Kullmann and H. Luckhardt, Deciding prepositional tautologies: algorithms and their complexity, http://www.cs.toronto.edu/kullmann.
12. B. Monien and E. Speckenmeyer, Solving satisfiability in less than 2n steps, Discrete Applied Mathematics, 10:287-295, 1985.
13. R. Paturi, P. Pudlak, and F. Zane, Satisfiability coding lemma, Proceedings of 38th IEEE Symposium on Foundations of Comp. Sci., pp. 566-574, 1997.
14. R. Paturi, P. Pudlak, M. E. Saks, and F. Zane. An improved exponential-time algorithm for k-SAT, Proceedings of 39th IEEE Symposium on Foundations of Comp. Sci., pp. 628-637, 1998.
15. R. Rodosek, A new approach on solving 3-satisfiability, Proceedings of 3rd Int. Conference on AI and Symbolic Mathematical Computing, Springer-Verlag, LNCS 1138, pp. 197-212, 1996.
16. J. Rintanen, Improvements to the evaluation of quantified Boolean formulae, 16th Int. Joint Conference on AI, pp. 1192-1197, 1999.
17. J. Rintanen, Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulas, Workshop on Theory and Applications of QBF, Int. Joint Conference on Automated Reasoning, 2001.
18. R. Schuler, U. Schöning, and O. Watanabe, An improved randomized algorithm for 3-SA T, Technical Report TR-C146, Dept. of Mathematical and Computing Sci., Tokyo Inst, of Tech., 2001.
19. U. Schöning, A probabilistic algorithm for k-SAT and constraint satisfaction problems, Proceedings of 40th IEEE Symposoum on Foundations of Comp. Sci., pp. 410-414, 1999.