Using SAT in QBF

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

Volumn 3709 LNCS, Issue , 2005, Pages 578-592

  Samulowitz, Horst ^a   Bacchus, Fahiem ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

BACKTRACKING SEARCH; BOOLEAN FORMULAE; POLYNOMIAL SPACE; QUANTIFIER NESTING;

BOOLEAN ALGEBRA;

EID: 33646191686     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_43     Document Type: Conference Paper

References (25)

1. G. Audemard and L. Saïs. A symbolic search based approach for quantified boolean formulas, to be published at SAT 2005.
2. P. Beame, H. Kautz, and A. Sabharwal. Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research, 22:319-351, 2004.
3. M. Bcnedctti. skizzo: a qbf decision procedure based on propositional skolemization and symbolic reasoning. Technical Report TR04-11-03, 2004.
4. A. Bierc. Resolve and expand. In Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 238-246, 2004.
5. Lucas Bordeaux and Eric Monfroy. Beyond np: Arc-consislcncy for quantified constraints. In Principles and Practice of Constraint Programming, pages 371-386, 2002.
6. R. Bryant, S. Lahiri, and S. Seshia. Convergence testing in term-level bounded model checking. Technical Report CMU-CS-03-156, Carnegie Mellon University, 2003.
7. H. K. Büning, M. Karpinski, and A. Flügel. Resolution for quantified boolean formulas. Inf. Comput., 117(1):12-18, 1995.
8. Joshua Buresh-Oppenheim and Toniann Pitassi. The complexity of resolution refinements. In IEEE Symposium on Logic in Computer Science, pages 138-147, 2003.
9. M. Cadoli, A. Giovanardi, and M. Schaerf. An algorithm to evaluate quantified boolean formulae. In Proceedings of the AAAI National Conference (AAAI), pages 262-267, 1998.
10. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 4:394-397, 1962.
11. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
12. Uwe Egly, Thomas Eiter, Hans Tonipits, and Stefan Woltran. Solving advanced reasoning tasks using quantified boolean formulas. In AAAI/IAAI, pages 417-422, 2000.
13. I.P. Gent, H.H. Hoos, A.G.D. Rowley, and K. Smyth. Using stochastic local search to solve quantified boolean formulae. In Principles and Practice of Constraint Programming -CP '2003, pages 348-362, 2003.
14. E. Giunchiglia, M. Narizzano, and A. Tacchella. Backjumping for quantified boolean logic satisfiability. In Proceedings of the International Joint Conference on Anifical Intelligence (IJCAI), pages 275-281, 2001.
15. E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A system for deciding quantified boolean formulas satisfiability. In International Joint Conference on Automated Reasoning (IJCAR), pages 364-369, 2001.
16. E. Giunchiglia, M. Narizzano, and A. Tacchella. Learning for quantified boolean logic satisfiability. In Eighteenth national conference on Artificial intelligence, pages 649-654, 2002.
17. Reinhold Letz. Lemma and model caching in decision procedures for quantified boolean formulas. In TABLEAUX '02: Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, pages 160-175, 2002.
18. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. In Proc. of the Design Automation Conference (DAC), 2001.
19. G. Pan and M. Y. Vardi. Symbolic decision procedures for qbf. In Principles and Practice of Constraint Programming, number 3258 in Lecture Notes in Computer Science, pages 453-467. Springer-Verlag, New York, 2004.
20. A. Remshagen and K. Truemper. An effective algorithm for the futile questioning problem. Journal of Automated Reasoning, to be published.
21. Jussi Rintanen. Constructing conditional plans by a theorem-proven Journal of Artificial Intelligence Research, 10:323-352, 1999.
22. A.G.D. Rowley. Forthcoming. PhD thesis, University of St. Andrews, 2005.
23. L.J. Stockmeyer and A.R. Meyer. Word problems requiring exponential time. Journal of the ACM, pages 1-9, 1973.
24. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In International Conference on Computer-Aided Design (ICCAD'01), pages 279-285, November 2001.
25. L. Zhang and S. Malik. Towards symmetric treatment of conflicts and satisfaction in quantified boolean satisfiability solver. In Principles and Practice of Constraint Programming (CP2002), pages 185-199, 2002.