Ordered Binary Decision Diagrams and the Davis-Putnam procedure
- 23 November 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- Algebraic decision diagrams and their applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagramsPublished by Association for Computing Machinery (ACM) ,1991
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- The Use of Renaming to Improve the Efficiency of Clausal Theorem ProvingPublished by Elsevier ,1990
- Embedding boolean expressions into logic programmingJournal of Symbolic Computation, 1987
- Application of term rewriting techniques to hardware design verificationPublished by Association for Computing Machinery (ACM) ,1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986