Q-PREZ: QBF evaluation using partition, resolution and elimination with ZBDDs

Proceedings of the IEEE International Conference on VLSI Design

Volumn , Issue , 2005, Pages 189-194

  Chandrasekar, Kameshwar ^a   Hsiao, Michael S ^a  

^a Virginia Polytechnic Institute and State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREE SEARCH; QUANTIFIED BOOLEAN FORMULA (QBF); RESOLUTION-BASED METHODS; SPACE EXPLOSION;

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTER AIDED DESIGN; DATA STRUCTURES; PROBLEM SOLVING;

VLSI CIRCUITS;

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

References (22)

1. C. Scholl and B. Becker, "Checking equivalence for partial implementations", In Proc. of DAC, 2001, pp. 18-22.
2. M. Mneimneh and K. Sakallah, "Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution", In Proc. of Sixth Intl. Conf. on Theory and Applications of SAT Testing, 2003.
3. C. Haubelt and R. Feldmann, "SAT-Based Techniques in System Synthesis", In Proc. of DATE, 2003, pp. 1168-1169.
4. H. Kleine-Buning, M. Karpinski and A. Flogel, "Resolution for Quantified Boolean Formulas", In Information and Computation, 1995.
5. L. Zhang and S. Malik, "Conflict Driven Learning in a Quantified Boolean Sat. Solver", In Proc. of ICCAD, 2002.
6. L. Zhang and S. Malik, "Towards symmetric treatment of conflicts and satisfaction in Quantified Boolean Satisfiability solver", In Proc. of Constrained Programming, 2002.
7. M. Cadoli, M. Schaerf, A. Giovanardi and M. Giovanardi, "An algorithm to evaluate quantified Boolean formulae and its experimental evaluation", In Highlights of SAT Research in 2000, IOS Press, 2000.
8. J. Rintanen, "Improvements to the evaluation of Quantified Boolean Formulae", In Proc. of IJCAI, 1999.
9. E. Giunchiglia, M. Narizzano and A. Tacchella, "Qube: A system for deciding Quantified Boolean Formulas Satisfiability.", In Proc. of IJCAR, 2001.
10. E. Giunchiglia, M. Narizzano and A. Tacchella, "Backjumping for Quantified Boolean Logic Satisfiability", Proc. of IJCAI, 2001.
11. D.L. Berre, L. Simon and A. Tacchella, "Challenges in QBF arena: SAT03 evaluation of QBF solvers", In Proc. of LNAI, 2003.
12. F.M. Brown, "Boolean Reasoning: The Logic of Boolean Equations", Kluwer Academic Publishers, 1990.
13. P. Cathalic and L. Simon, "Multi-resolution on compressed sets of clauses", In Proc. of ICTAI, 2000.
14. S. Minato, "ZBDDs for Set Manipulation in Combinatorial Problems", In Proc. of DAC, 1993, pp. 272-277.
15. A. Mishchenko, "An Introduction to ZBDDs", http://www.ee.pdx. edu/alanmi/research.
16. F. Somenzi, "CUDD: CU Decision Diagram Package", http://vlsi.Colorado.edu/fabio/CUDD/.
17. A. Mishchenko, "EXTRA v 2.0: Software Lib. Extending CUDD", http://www.ee.pdx.edu/alanmi/research/extra.htm.
18. F. Aloul, M. Mneimneh and K. Sakallah, "Search based SAT using ZBDDs", In Proc. of DATE, 2002, pp. 1082.
19. D. B. Motter and I. L. Markov, "A compressed Breadth First Search for Satisfiability" LNCS, 2002, Vol. 2409, pp. 29-42.
20. G. Karypis, "METIS v 4.0.1: Serial Graph Partitioning", http://www-users.cs.umn.edu/karypis/metis/metis/index.html.
21. M. Narizanno and A. Tacchella, "QBFLIB - The Quantified Boolean Formulas Satisfiability Library", www.qbflib.org
22. Armin Biere, "Resolve and Expand", Proc. of SAT 2004, 2004.