Quantifier trees for QBFs

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 378-385

  Benedetti, Marco ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS;

PRENEX NORMAL FORMS; QUANTIFIER TREE RECONSTRUCTION;

TREES (MATHEMATICS);

EID: 26444615379     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_28     Document Type: Conference Paper

References (14)

1. M. Benedetti. Quantifier Trees for QBFs, Tech.Rep. 05-04-08, ITC-irst, 2005.
2. M.Benedetti. sKizzo's website, sra.itc.it/people/benedetti/sKizzo, 2004.
3. M. Benedetti. Evaluating QBFs via Symbolic Skolemization. In Proc. of LPAR04, number 3452 in LNCS. 2005.
4. A. Biere. Resolve and Expand. In Proc. of SAT'04, pages 238-246, 2004.
5. H. K. Büning and T. Lettmann. Propositional Logic: Deduction and Algorithms. Cambridge University Press, 1999.
6. M. Cadoli, A. Giovanardi, and M. Schaerf. An algorithm to evaluate quantified boolean formulae. In Proc. of the tenth conference on Artificial Intelligence/Innovative applications of artificial intelligence. AAAI, 1998.
7. M. GhasemZadeh, V. Klotz, and C. Meinel. ZQSAT: A QSAT Solver based on Zero-suppressed Binary Decision Diagrams, available at www.informatik.uni-trier. de/ TI/bdd-research/zqsat/zqsat.html, 2004.
8. E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE++: an Efficient QBF Solver. In Proc. of the 5th Int. Conf. on Formal Methods in Computer-Aided Design (FMCAD), 2004.
9. H. Kleine-Buning, M. Karpinski, and A. Flogel. Resolution for quantified Boolean formulas. Information and Computation, 117(1):12-18, 1995.
10. R. Letz. Advances in Decision Procedures for Quantified Boolean Formulas. In Proceedings of the First International Workshop on Quantified Boolean Formulae (QBF'01), pages 55-64, 2001.
11. A. Nonnengart and C. Weidenbach. Computing Small Clause Normal Forms. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, chapter 6, pages 335-367. Elsevier, Amsterdam, Netherlands, 2001.
12. G. Pan and M.Y. Vardi. Symbolic Decision Procedures for QBF. In Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP04), 2004.
13. C. Thiffault, F. Bacchus, and T. Walsh. Solving Non-clausal Formulas with DPLL search. In Proc. of SAT04, 2004.
14. L. Zhang and S. Malik. Towards Symmetric Treatment of Conflicts And Satisfaction in Quantified Boolean Satisfiability Solver. In Proc. of CP'02, 2002.