Evaluating QBFs via symbolic skolemization

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

Volumn 3452 LNAI, Issue , 2005, Pages 285-300

  Benedetti, Marco ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; THEOREM PROVING;

GLUE HOLDING; QUANTIFIED BOOLEAN FORMULAS (QBF); SYMBOLIC SKOLEMIZATION;

DECISION MAKING;

EID: 26844575211     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32275-7_20     Document Type: Conference Paper

References (34)

1. A. Ayari and D. Basin. Bounded Model Construction for Monadic Second-order Logics. In Proc. of CAV'00, 2000.
2. F. Bacchus and J. Winter. Effective Preprocessing with Hyper-Resolution and Equality Reduction. In Proc. of SAT'03, 2003.
3. M. Benedetti. sKizzo: a QBF Decision Procedure based on Prepositional Skolemization and Symbolic Reasoning, Tech.Rep. 04-11-03, ITC-irst, available at sra.itc.it/people/benedetti/sKizzo, 2004.
4. A. Biere. Resolve and Expand. In Proc. of SAT'04, pages 238-246, 2004.
5. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic Model Checking without BDDs. In Proc. of Design Automation Conference, volume 1579, pages 193-207, 1999.
6. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transaction on Computing, C-35(8):677-691, 1986.
7. Marco Cadoli, Andrea Giovanardi, and Marco Schaerf. An algorithm to evaluate quantified boolean formulae. In Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, pages 262-267. American Association for Artificial Intelligence, 1998.
8. P. Chatalic and L. Simon. Multi-Resolution on compressed sets of clauses. In Proceedings of the Twelfth International Conference on Tools with Artificial Intelligence (ICTAI'00), 2000.
9. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5:394-397, 1962.
10. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7, 1960.
11. R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 285-290, 2000.
12. M. Fitting. First-Order Logic and Automated Theorem Proving. Springer Verlag, 1996.
13. J. Franco, M. Kouril, J. Schlipf, J. Ward, S. Weaver, M. Dransfield, and W. Vanfleet. SBSAT: a state-based, BDD-based satisfiability solver. In Proceedings of SAT'03, 2003.
14. M. GhasemZadeh, V. Klotz, and C. Meinel. ZQSAT: A QSAT Solver based on Zero-suppressed Binary Decision Diagrams, available at http://www.informatik. unitrier.de/TI/bdd-research/zqsat/zqsat.html, 2004.
15. E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE: A system for deciding Quantified Boolean Formulas Satisfiability. In Proc. of the International Joint Conference on Automated Reasoning (IJCAR'2001), 2001.
16. Daniel Jackson. Automating first-order relational logic. In Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering, pages 130-139. ACM Press, 2000.
17. H. Kautz and B. Selman. Planning as satisfiability. In Proc. of ECAI 1992, pages 359-363.
18. H. Kleine-Buning, M. Karpinski, and A. Flogel. Resolution for quantified Boolean formulas. Information and Computation, 117(1):12-18, 1995.
19. T. Larrabee. Test pattern generation using boolean satisfiability. In IEEE Transaction on Computer-aided Design, pages 4-15, 1992.
20. D. Le Berre, M. Narizzano, L. Simon, and A. Tacchella. Second QBF solvers evaluation, available on-line at www.qbflib.org, 2004.
21. D. Le Berre, L. Simon, and A. Tacchella. Challenges in the QBF arena: the SAT03 evaluation of QBF solvers, available on-line at www.qbflib.org, 2003.
22. 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.
23. R. Letz. Lemma and model caching in decision procedures for quantified boolean formulas. In Proc. of the Int. Conf. on Automated Reasoning with Analytic Tableaux and Related Methods, pages 160-175. Springer-Verlag, 2002.
24. 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, 2001.
25. D. B. Motter and I. L. Markov. A compressed, breadth-first search for satisfiability. LNCS, 2409:29-42, 2002.
26. 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.
27. G. Pan and M.Y. Vardi. Search vs. Symbolic Techniques in Satisfiability Solving. In Proceedings of SAT 2004, 2004.
28. 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.
29. J. Rintanen. Construction Conditional Plans by a Theorem-prover. Journal of A. I. Research, pages 323-352, 1999.
30. J. Rintanen. Partial implicit unfolding in the davis-putnam procedure for quantified boolean formulae. In Proceedings of the International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'01), 2001.
31. T. Skolem. Logico-combinatorial investigations in the satisfiability or provability of mathematical propositions: a simplified proof of a theorem by L. Löwenheim and generalizations of the theorem. In From Frege to Gödel. A Source Book in Mathematical Logic, 1879-1931, pages 252-263. Harvard University Press, Cambridge, 1967 (1920).
32. Fabio Somenzi. Colorado University Binary Decision Diagrams, vlsi.colorado.edu/fabio/CUDD, 1995.
33. T. E. Uribe and M. E. Stickel. Ordered binary decision diagrams and the Davis-Putnam procedure. In J. P. Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, volume 845, pages 34-49, 1994.
34. L. Zhang and S. Malik. Towards Symmetric Treatment of Conflicts And Satisfaction in Quantified Boolean Satisfiability Solver. In Proc. of CP'02, 2002.