Validating the result of a Quantified Boolean Formula(QBF) solver: Theory and practice

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 2, Issue , 2005, Pages 1047-1051

  Yu, Yinlei ^a   Malik, Sharad ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QBF SOLVERS; QUANTIFIED BOOLEAN FORMULAS; SUBFORMULAS; THEORY AND PRACTICE;

COMPUTER AIDED DESIGN;

BOOLEAN FUNCTIONS;

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

References (19)

1. QBF evaluation 2004 benchmarks, available from http://www.mrg.dist.unige. it/qbflib/benchmarks/04secondtest5Ct.tar, 2004.
2. R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Convergence testing in term-level bounded model checking. In Proc. CHARME'03, vol. 2860 of LNCS, pp. 348-362, 2003.
3. H. K. Büning, M. Karpinski, and A. Flogel. Resolution for quantified Boolean formulas. Information and Computation, 117(1):12-18, 1995.
4. M. Cadoli and M. Schaerf. An algorithm to evaluate quantified Boolean formulae and its experimental evaluation. In Highlights of Satisfiability Research in 2000, 2000.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Comm. ACM, 5(7):394-397, July 1962.
6. M. Davis and H. Putnam. A computing procedure for quantification theory. J. ACM, 7(3):201-215, July 1960.
7. U. Egly, T. Eiter, H, Tompits, and S. Woltran. Solving advanced reasoning tasks using quantilied Boolean formulas. In Proc. AAAl'OO and 1A *A1 '00, pp. 417-422, 2000.
8. E. Giunchiglia, M. Narizzano, and A. Tacchella. Learning for quantified Boolean logic satisfiability. In Proc. AAAI'02, pp. 649-654, 2002.
9. G. Gopalakrishnan, Y. Yang, and H. Sivaraj. QB or not QB: An efficient execution verification tool for memory ordering;. In Proc. CAV'04, 2004.
10. J R. Letz. Lemma, model caching in decision procedures for quantified Boolean formulas. In Proc. TABLEAUX'02, vol. 2381 of LNCS, pp. 160-175, 2002.
11. M. Mneimneh and K. A. Sakallah. Computing vertex eccentricity in exponentially large graphs: QBF formulation and solution. In Proc. SAT'03, vol. 2919 of LNCS, pp. 411-425, 2O03.
12. D. A. Plaisted, A. Biere, and Y. Zhu, A satisfiability procedure for quantified Boolean formulae. Discrete Appl. Math., 130(2):291-328, 2003.
13. J. Rintanen. Constructing conditional plans by a theorem-prover. J. of Artificial Intelligence Research, 10:322-352, 1999.
14. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time. In Proc. 5th Annual ACM Symp. on Theory of Computing, pp. 1-9, 1973
15. Y. Yang, G. Gopalakrishnan, G. Lindstrom, and K, Slind. Analyzing the Intel Itanium memory ordering rules using logic programming and SAT. In Proc. CHARME'03, vol. 2860 of LNCS, pp. 81-95, 2003.
16. Y. Yu and S. Malik. yQuaffle QBF solver. available from http://www.princeton.edu/ chaff/quaffle.html
17. L. Zhang and S. Malik. Conflict driven learning in a quantified Boolean satisfiability solver.
18. L. Zhang and S, Malik. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications.
19. L. Zhang and S, Malik. Towards a symmetric treatment of satisfaction and conflicts in quantified Boolean formula evaluation. In Proc. CP'02, vol. 2470 of LNCS, pp. 200-215, 2002.