A satisfiability procedure for quantified Boolean formulae

Discrete Applied Mathematics

Volumn 130, Issue 2, 2003, Pages 291-328

  Plaisted, David A ^a   Biere, Armin ^b   Zhu, Yunshan ^c  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b ETH ZURICH   (Switzerland)

^c SYNOPSYS INC   (United States)

Author keywords

BDDs; Circuit verification; Cut width; Davis and Putnam procedure; Model checking; QBF; Satisfiability

Indexed keywords

ALGORITHMS; DECISION THEORY;

MODEL CHECKING;

BOOLEAN ALGEBRA;

EID: 0042014051     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00409-2     Document Type: Conference Paper

References (31)

1. Berman C.L. Circuit width, register allocation and ordered binary decision diagrams. IEEE Trans. CAD. 10(8):1991;1059-1066.
2. C.L. Berman, L.H Trevillyan, Functional comparison of logic designs for VLSI circuits, in: Proceedings of International Conference on Computer Aided Design, 1989, pp. 456-459.
3. A. Biere, A. Cimatti, E.M. Clarke, Y. Zhu, Symbolic model checking without BDDs, in: TACAS'99, Lecture Notes in Computer Science, Vol. 1579, Springer, Berlin, 1999.
4. Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8):1986;677-691.
5. Buening H.K., Karpinski M., Fluegel A. Resolution for quantified Boolean formulas. Inform. and Comput. 117:1995;12-18.
6. 20 states and beyond Inform. Comput. 98:1992;142-170.
7. M. Cadoli, A. Giovanardi, M. Schaerf, An algorithm to evaluate quantified Boolean formulae, in: J. Mostow and C. Rich (Eds), Proceedings of AAAI-98, Madison, WI, USA, July 26-30, 1998.
8. P. Chatalic, L. Simon, ZRes: the old Davis-Putnam procedure meets ZBDD, in: International Conference on Automated Deduction (CADE'00), Lecture Notes in Artificial Intelligence, Vol. 1831, Springer, Berlin, 2000, pp. 449-454.
9. L.J. Claesen, Efficient tautology checking algorithms, in: Formal VLSI Correctness Verification - VLSI Design Methods, Vol. II, Elsevier, Amsterdam, 1990 (Chapter 2).
10. Clarke E.M. Jr., Grumberg O., Peled D.A. Model Checking. 1999;MIT Press, Cambridge MA.
11. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7:1960;201-215.
12. Davis M., Logemann G., Loveland D. A machine program for theorem-proving. C. ACM. 5:1962;394-397.
13. DIMACS challenge benchmarks, ftp://ftp.rutgers.dimacs.edu/challenges/sat.
14. Groote J.F., Warners J.P. The propositional formula checker Heer Hugo. J. Automated Reason. 24(1-2):2000;101-125.
15. Gu J., Purdom P.W., Franco J., Wah B.W. Algorithms for the satisfiability (SAT) problem. a survey DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 35:1997;19-151.
16. A. Gupta, P. Ashar, Integrating a Boolean satisfiability checker and BDDs for combinational verification, in: Proceedings of VLSI Design, vol. 98, 1998, pp. 222-225.
17. Kropf T. Introduction to Formal Hardware Verification. 1999;Springer, Berlin.
18. Kuehlmann A., Srinivasan A., LaPotin D.P. Verity - a formal verification program for custom CMOS circuits. IBM J. Res. Dev. 39:1995;149-165.
19. McMillan K.L. Symbolic Model Checking: An Approach to the State Explosion Problem. 1993;Kluwer Academic Publishers, Dordrecht.
20. S. Minato, Zero-suppressed BDD's for set manipulation in combinatorial problems, in: 30th ACM/IEEE Design Automation Conference, 1993, pp. 272-277.
21. Plaisted D., Greenbaum S. A structure-preserving clause form translation. J. Symbolic Comput. 2:1986;293-304.
22. M.R. Prasad, P. Chong, K. Keutzer, Why is ATPG easy?, in: Proceedings of the 36th Design Automation Conference (DAC99), 1999, pp. 22-28.
23. Rintanen J. Improvements to the evaluation of quantified Boolean formulae. Dean T. Proceedings of the 16th International Joint Conference on Artificial Intelligence. 1999;1192-1197 Morgan Kaufmann, Los Altos, CA.
24. Rish I., Dechter R. Resolution versus search. two strategies for SAT J. Automated Reason. 24(1-2):2000;225-275.
25. J.P.M. Silva, Search algorithms for satisfiability problems in combinational switching circuits, Ph.D. Dissertation, EECS Department, University of Michigan, May 1995.
26. Stålmarck G., Säflund M. Modeling and verifying systems and software in propositional logic. Daniels B.K. Safety of Computer Control Systems (SAFECOMP'90). 1990;31-36 Pergamon Press, Oxford.
27. P.R. Stephan, R.K. Brayton, A.L. Sangiovanni-Vincentelli, Combinational test generation using satisfiability, Technical Report M92/112, Department of Electrical Engineering and Computer Science, University of California at Berkeley, October 1992.
28. Truemper K. Effective Logic Computation. 1998;Wiley, New York.
29. T.E. Uribe, M. Stickel, Ordered binary decision diagrams and the Davis-Putnam Procedure, in: J.P. Jouannaud (Ed.), Proceedings of the First International Conference on Constraints in Computational Logics, Lecture Notes in Computer Science, Vol. 845, Springer, Berlin, 1994.
30. W.J. Yakowenko, Propositional theorem proving by semantic tree trimming for hardware verification, Ph.D. Thesis, University of North Carolina at Chapel Hill, July 1999.
31. H. Zhang, SATO: an efficient propositional prover, in: International Conference on Automated Deduction (CADE'97), Lecture Notes in Artificial Intelligence, Vol. 1249, Springer, Berlin, 1997, pp. 272-275.