QUBE++: An efficient QBF solver

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

Volumn 3312, Issue , 2004, Pages 201-213

  Giunchiglia, Enrico ^a   Narizzano, Massimo ^a   Tacchella, Armando ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER AIDED DESIGN; ENGINES; FORMAL METHODS;

EFFICIENT SOLVERS; LITERALS; QBF SOLVERS; QUANTIFIED BOOLEAN FORMULAS; REASONING ENGINE; SAT INSTANCES; STATE OF THE ART;

BOOLEAN FUNCTIONS;

EID: 35048828305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30494-4_15     Document Type: Article

References (24)

1. C. Scholl and B. Becken Checking equivalence for partial implementations. In 38th Design Automation Conference (DAC'01), 2001.
2. Abdelwaheb Ayari and David Basin. Bounded model construction for monadic second-order logics. In 12th International Conference on Computer-Aided Verification (CAV'OO), number 1855 in LNCS, pages 99-113. Springer-Verlag, 2000.
3. J. Rintanen. Constructing conditional plans by a theorem prover. Journal of Artificial Intelligence Research. 10:323-352, 1999.
4. C. Castellini, E. Giunchiglia, and A. Tacchella. Sat-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence, 147(1):85-117, 2003.
5. Guoqiang Pan and Moshe Y. Vardi. Optimizing a BDD-based modal solver. In Proceedings of the 19th International Conference on Automated Deduction, 2003.
6. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. In Proceedings of TACAS, volume 1579 of LNCS, pages 193-207. Springer-Verlag, 1999.
7. F. Copty, L. Fix, Ranan Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Y. Vardi. Benefits of Bounded Model Checking at an Industrial Setting. In Proc. of CAV, LNCS. Springer-Verlag, 2001.
8. P. A. Abdulla, P. Bjesse, and N. Eén. Symbolic Reachability Analisys Based on SAT-Solvers. In Proceedings of TACAS, volume 1785 of LNCS, pages 411-425. Springer-Verlag, 2000.
9. D. Le Berre, L. Simon, and A. Tacchella. Challenges in the QBF arena: the SAT'03 evaluation of QBF solvers. In Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), volume 2919 of Lecture Notes in Computer Science. Springer Verlag, 2003.
10. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, 1960.
11. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394-397, 1962.
12. I. Gent, E. Giunchiglia, M. Narizzano, A. Rowley, and A. Tachella. Watched data structures for QBF solvers. In Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT'03), pages 348-355, 2003. Extended Abstract.
13. E. Giunchiglia, M. Narizzano, and A. Tacchella. Learning for quantified boolean logic satisfiability. In Eighteenth National Conference on Artificial Intelligence (AAAI'02). AAAI Press/MIT Press, 2002.
14. J. P. Marques-Silva and K. A. Sakallah. GRASP - A New Search Algorithm for Satisfiability. In Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pages 220-227, November 1996.
15. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC'01), pages 530-535, 2001.
16. E. Giunchiglia, M. Maratea, and A. Tacchella. (In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver. In 9th Conference on Principles and Practice of Constraint Programming (CP 2003), volume 2833 of Lecture Notes in Computer Science. Springer Verlag, 2003.
17. L. Zhang and S. Malik. Conflict driven learning in a quantified boolean satisfiability solver. In Proceedings of International Conference on Computer Aided Design (ICCAD'02), 2002.
18. E. Giunchiglia, M. Narizzano, and A. Tacchella. Backjumping for Quantified Boolean Logic Satisfiability. In Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001). Morgan Kaufmann, 2001.
19. 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, 2001.
20. R. J. Bayardo, Jr. and R. C. Schrag. Using CSP Look-Back Techniques to Solve Real-World SAT instances. In Proc. of AAAI, pages 203-208. AAAI Press, 1997.
21. E. Giunchiglia, M. Narizzano, and A. Tacchella. Quantified Boolean Formulas satisfiability library (QBFLIB), 2001. www.qbflib.org.
22. R. Letz. Lemma and model caching in decision procedures for quantified boolean formulas. In Proceedings of Tableaux 2002, LNAI 2381, pages 160-175. Springer, 2002.
23. L. Simon, D. Le Berre, and E. A. Hirsch. The SAT2002 Competition, 2002.
24. L. Simon and D. Le Berre. The essentials of SAT 2003 Competition. In Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), volume 2919 of Lecture Notes in Computer Science. Springer Verlag, 2003.