The second QBF solvers comparative evaluation

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 376-392

  Berre, Daniel Le ^a   Narizzano, Massimo ^c   Simon, Laurent ^b   Tacchella, Armando ^c  

^a UNIVERSITÉ D'ARTOIS   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER HARDWARE; PROBLEM SOLVING; RESEARCH; SET THEORY;

EVALUATION INFRASTRUCTURE; NON-COMPETITIVE EVENTS; QUANTIFIED BOOLEAN FORMULAS (QBFS); TEST SET;

BOOLEAN ALGEBRA;

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

References (22)

1. 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.
2. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, 1960.
3. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394-397, 1962.
4. A. G. D. Rowley I. P. Gent, H. H. Hoos and K. Smyth. Using stochastic local search to solve quantified boolean formulae. In 9th Conference on Principles and Practice of Constraint Programming (CP 2003), volume 2833 of Lecture Notes in Computer Science. Springer Verlag, 2003.
5. A. Biere. Resolve and Expand. In Seventh Intl. Conference on Theory and Applications of Satisfiability Testing, 2004. Extended Abstract.
6. Guoqiang Pan and Moshe Y. Vardi. Symbolic decision procedures for qbf. In 10th Conference on Principles and Practice of Constraint Programming (CP 2004), 2004.
7. Ian Gent and Toby Walsh. Beyond NP: the QSAT phase transition. In Proc. of AAAI, pages 648-653, 1999.
8. E. Giunchiglia, M. Narizzano, and A. Tacchella. Quantified Boolean Formulas satisfiability library (QBFLIB), 2001. www.qbflib.org.
9. Andrew G D Rowley Ian P Gent. Solution learning and solution directed backjumping revisited. Technical Report APES-80-2004, APES Research Group, February 2004.
10. D. Le Berre, M. Narizzano, L. Simon, and A. Tacchella, editors. Second QBF solvers evaluation. Pacific Institute of Mathematics, 2004. Available on-line at www.qbflib.org.
11. Jussi Rintanen. Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. In Logic for Programming, Artificial Intelligence and Reasoning. 8th International Conference, number 2250 in LNAI, pages 362-376. Springer, 2001.
12. R. Feldmann, B. Monien, and S. Schamberger. A distributed algorithm to evaluate quantified boolean formula. In Proceedings of the Seventeenth National Conference in Artificial Intelligence (AAAI'00), pages 285-290, 2000.
13. 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.
14. Abdelwaheb Ayari and David Basin. Bounded model construction for monadic second-order logics. In 12th International Conference on Computer-Aided Verification (CAV'00), number 1855 in LNCS, pages 99-113. Springer-Verlag, 2000.
15. C. Castellini, E. Giunchiglia, and A. Tacchella. Sat-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence, 147(1):85-117, 2003.
16. Andrew G D Rowley Ian P Gent. Encoding connect 4 using quantified boolean formulae. Technical Report APES-68-2003, APES Research Group, July 2003.
17. M. Mneimneh and K. Sakallah. Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution. In Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), volume 2919 of Lecture Notes in Computer Science. Springer Verlag, 2003.
18. Guoqiang Pan and Moshe Y. Vardi. Optimizing a BDD-based modal solver. In Proceedings of the 19th International Conference on Automated Deduction, 2003.
19. P. Balsiger, A. Heuerding, and S. Schwendimann. A benchmark method for the propositional modal logics k, kt, s4. Journal of Automated Reasoning, 24(3):297-317, 2000.
20. Jussi Rintanen. Improvements to the evaluation of quantified boolean formulae. In Proceedings of the Sixteenth International Joint Conferences on Artificial Intelligence (IJCAI'99), pages 1192-1197, Stockholm, Sweden, July 31-August 6 1999. Morgan Kaufmann.
21. C. Scholl and B. Becker. Checking equivalence for partial implementations. In 38th Design Automation Conference (DAC'01), 2001.
22. E. Giunchiglia, M. Narizzano, and A. Tacchella. An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas Satisfiability. In Seventh Congress of the Italian Association for Artificial Intelligence (AI*IA 2001), volume 2175 of Lecture Notes in Artificial Intelligence. Springer Verlag, 2001.