Conflict driven learning in a quantified Boolean satisfiability solver

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2002, Pages 442-449

  Zhang, Lintao ^a   Malik, Sharad ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85013873725     PISSN: 10923152     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICCAD.2002.1167570     Document Type: Article

References (24)

1. J. Rintanen. Constructing conditional plans by a theorem prover. Journal of Artificial Intelligence Research, 10:323-352, 1999
2. M. Sheeran, S. Singh, G. Stälmark, Checking Safety Properties Using Induction and a SAT-Solver, in Proc. of FMCAD, 2000
3. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs, In Tools and Algorithms for the Analysis and Construction of Systems (TACAS), 1999
4. H. Kleine-Büning, M. Karpinski and A. Flögel. Resolution for quantified Boolean formulas. In Information and Computation, 117(1):12-18, 1995
5. D. A. Plaisted, A. Biere and Y. Zhu. A Satisfiability Procedure for Quantified Boolean Formulae, to appear, Discrete Applied Math.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. In Communications of the ACM, 5:394-397, 1962
7. M. Cadoli, M. Schaerf, A. Giovanardi and M. Giovanardi. An algorithm to evaluate quantified Boolean formulae and its experimental evaluation, in Highlights of Satisfiability Research in the Year 2000, IOS Press, 2000
8. J. Rintanen, Improvements to the Evaluation of Quantified Boolean Formulae, in Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 1999
9. J. Rintanen, Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae, in International Conf. on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), 2001
10. E. Giunchiglia, M. Narizzano and A. Tacchella., Qube: a system for Deciding Quantified Boolean Formulas Satisfiability., In Proceedings of International Joint Conference on Automated Reasoning (IJCAR), 2001
11. E. Giunchiglia, M. Narizzano and A. Tacchella. Backjumping for Quangified Boolean Logic Satisfiability. In Proceedings of International Joint Conf. on Artificial Intelligence (IJCAI), 2001
12. João P. Marques-Silva and Karem A. Sakallah, “GRASP: A Search Algorithm for Propositional Satisfiability, In IEEE Transactions on Computers, vol. 48, 506-521, 1999
13. R. Bayard and R. Schrag. Using CSP look-back techniques to solve real-world SAT instances, in Proc. of the 14th Nat. (US) Conf. on Artificial Intelligence (AAAI), 1997
14. H. Zhang. SATO: An efficient propositional prover, In Proc. of the International Conf. on Automated Deduction, 1997
15. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Engineering an efficient SAT Solver, In Proc. of the Design Automation Conference (DAC), 2001
16. L. Zhang, C. Madigan, M. Moskewicz, S. Malik, Efficient Conflict Driven Learning in a Boolean Satisfiability Solver, in Proc. of International Conf. on Computer Aided Design (ICCAD), 2001
17. D.A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation, in J. of Symbolic Computation, 2:293-304, 1986
18. E. Giunchiglia, M. Narizzano and A. Tacchella, On the effectiveness of backjumping and trivial truth in quantified boolean formulas satisfiability, in IJCAR workshop on Theory and Application of Quantified Boolean Formulas, 2001
19. G. Hachtel and F. Somenzi, Logic Synthesis and Verification Algorithms, Kluwer Academic Publishers
20. J. Rintanen’s benchmark suites are available at http://ww.informatik.uni-freiburg.de/˜rintanen/qbf.html
21. More detailed and expanded experimental results are available at http://ee.princeton.edu/˜chaff/Quaffle.php
22. R. Letz, Lemma Model Caching in Decision Procedures for Quantified Boolean Formulas, in International Conf. on Automated Reasoning with Analytic Tableaux and Related Methods, 2002
23. E. Giunchiglia, M. Narizzano and A. Tacchella, Learning for Quantified Boolean Logic Satisfiability, in Proc. of the 18th Nat. (US) Conf. on Artificial Intelligence (AAAI), 2002
24. L. Zhang, S. Malik, Towards a symmetric treatment of satisfaction and conflicts in Quantified Boolean Formula Evaluation, in Proc. Eighth International Conference on Principles and Practice of Constraint Programming (CP2002), 2002