The ROBDD size of simple CNF formulas

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2860, Issue , 2003, Pages 363-377

  Langberg, Michael ^a   Pnueli, Amir ^a   Rodeh, Yoav ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; DECISION THEORY; DESIGN; MODEL CHECKING;

CNF FORMULAS; CNF REPRESENTATIONS; COMMON DYNAMICS; DEGENERATE CASE; LOWER AND UPPER BOUNDS; NON-TRIVIAL; REDUCED ORDERED BINARY DECISION DIAGRAM; VERIFICATION- , MODELING;

BOOLEAN ALGEBRA;

EID: 0142214497     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39724-3_32     Document Type: Article

References (10)

1. C. L. Herman, "Ordered binary decision diagrams and circuit structure", International Conference on Computer Design '89.
2. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation", In IEEE Transactions on Computing '86.
3. A. Biere, A. Cimatti, E. M. Clarke and M. Fujita, "Symbolic model checking using SAT procedures instead of BDDs", In Design Automation Conference DAC '99.
4. B. Bollig and I. Wegener, "Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems", In International Colloquium on Automata, Languages and Programming ICALP '00.
5. E. M. Clarke, O. Grumberg and D. Peled, "Model checking", The MIT Press.
6. C. Gropl, H. J. Promel and A. Srivastav, "On the evolution of worst case OBDD size", Information processing letters 77, 2001.
7. J.F. Groote and H. Zantema, "Resolution and Binary decision diagrams cannot simulate each other polynomially", Ershov Memorial Conference '01.
8. S. Janson, T. Luczak and A. Rucinski, "Random graphs", Wiley interscience series in discrete mathematics and optimization.
9. N. Robertson and P.D. Seymour, "Graph minors. 1. excluding a forest", Journal of Combinatorial Theory, Series B, 35, 1983.
10. P. Woelfel, "New bounds on the OBDD-size of integer multiplication via universal hashing", In IEEE Transactions on Computing '01.