Ordered binary decision diagrams and the davis-putnam procedure

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

Volumn 845 LNCS, Issue , 1994, Pages 34-49

  Uribe, Tomás E ^a   Stickel, Mark E ^b  

^a STANFORD UNIVERSITY   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CONSTRAINT SATISFACTION PROBLEMS; EQUIVALENCE CLASSES; LOGIC PROGRAMMING;

COMMON STRUCTURES; DECISION PROCEDURE; FUNCTIONAL EQUIVALENCE; HARD CONSTRAINTS; ORDERED BINARY DECISION DIAGRAMS; PROPOSITIONAL LOGIC;

BINARY DECISION DIAGRAMS;

EID: 33749771715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0016843     Document Type: Conference Paper

References (42)

1. ANUCHITANUKUL, A., AND MANNA, Z. Anti-isomorphic BDDs. Technical report, Computer Science Department, Stanford University, Stanford, CA, June 1994.
2. BAHAR, R.I., FROHM, E.A., GAONA, C.M., HACHTEL, G.D., MACII, E., PARDO, A., AND SOMENZI, F. Algebraic decision diagrams and their applications. In IEEE Intl. Conf. on Computer-Aided Design (Nov. 1993), pp. 188-191.
3. BENHAMOU, F., AND COLMERAUER, A., Eds. Constraint Logic Programming: Selected Research. MIT Press, 1993.
4. BOY DE LA TOUR, T;, AND CHAMINADE, G. The use of renaming to improve the efficiency of clausal theorem proving. In Art. Int. IV: Methodology, Systems, Applications (1990), P. Jorrand and V. Sgurev, Eds., Elsevier, pp. 3-12.
5. BRACE, K. S., RUDELL, R. L., AND BRYANT, R. E. Efficient implementation of a BDD package. In Proc. 27 th Design Automation Conf. (1990), pp. 40-45.
6. BRYANT, R. E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Computers 35, 8 (Aug. 1986), 677-691.
7. BRYANT, R.E. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. on Computers, 2 (Feb. 1991), 205-213.
8. BRYANT, A. E. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 25, 3 (Sept. 1992), 293-318.
9. BURCH, J. R., CLARKE, E. M., MCMILLAN, K. L., DILL, D. L., AND HWANG, L. J. Symbolic modelchecking: 102 states and beyond. Information and Computation 98, 2 (June 1992), 142-170.
10. BUTLER, K. M., Ross, D. E., KAPUR, R., AND MERCER, M.R. Heuristics to compute variable ordering for efficient manipulation of ordered binary decision diagrams. In Proc. 28 th Design Automation Conf. (1991), pp. 417-420.
11. BUTTNER, W., AND SIMONIS, H. Embedding Boolean expressions into logic programming. J. of Symbolic Computation 4, 2 (Oct. 1987), 191-205.
12. CHANDRASEKHAR, M. S., PRIVITERA, J. P., AND CONRADT, K. W. Application of term rewriting techniques to hardware design verification. In Proc. 24 th Design Automation Conf. (1987), pp. 277-282.
13. CLAESEN, L. J., Ed. Formal VLSI Correctness Verification--VLSI Design Methods, vol. II. Elsevier, 1990. Chap. 2, Efficient Tautology Checking Algorithms.
14. CLARKE, E. M., FUJITA, M., MCGEER, P. C., MCMILLAN, K., YANG, J. C.-Y., AND ZHAO, X. Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. In Proc. Intl. Workshop on Logic Synthesis (May 1993).
15. CRAWFORD, J. M., AND AUTON, L.D. Experimental results on the crossover point in satisfiability problems. In Proc. 11 th Nat. Conf. on AI (1993), pp. 21-27.
16. DAVIS, M., LOGEMANN, G., AND LOVELAND, D. A machine program for theoremproving. Comm. ACM 5, 7 (July 1962), 394-397.
17. DAVIS, M., AND PUTNAM, N. A computing procedure for quantification theory. J. ACM 7 (1960), 201-215.
18. DEVADAS, S. Comparing two-level and ordered binary decision diagram representations of logic functions. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 12, 5 (May 1993), 722-723.
19. FRIEDMAN, S. J., AND SUPOWITZ, K. J. Finding the optimal variable ordering for binary decision diagrams. IEEE Trans. on Computers 39, 5 (May 1990), 710-713.
20. FUJITA, M., SLANEY, J., AND BENNETT, F. Automatic generation of some results in finite algebra. In Proc. 14 th Intl. Joint Conf. on AI (1993), pp. 52-57.
21. HSIANG, J. Refutational theorem proving using term-rewriting systems. Artificial Intelligence 3, 25 (Mar. 1985), 255-300.
22. HU, A. J., AND DILL, D. L. Reducing BDD size by exploiting functional dependencies. In Proc. 30 th Design Automation Conf. (1993), pp. 266-271.
23. JEONG, S.-W., AND SOMENZI, F. A new algorithm for the binate covering problem and its application to the minimization of Boolean relations. In IEEE Intl. Conf. on Computer-Aided Design (1992), pp. 417-420.
24. JOYCE, J. J., AND SEGER, C.-J. H. Linking BDD-based symbolic evaluation to interactive theorem-proving. In 30 th Design Autom. Conf. (1993), pp. 469-474.
25. KAM, W. Y. K., AND BRAYTON, R. K. Multi-valued decision diagrams. Technical Report UCB/ERL M90/125, University of California, Berkeley, Dec. 1990.
26. LONG, D. E. Model Checking, Abstraction, and Compositional Verification. PhD thesis, School of Computer Science, Carnegie Mellon Univ., July 1993.
27. MCCARTHY, J. A tough nut for proof procedures. AI Memo 16, Stanford University, July 1964.
28. MCMILLAN, K. L. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
29. MINATO, S. Zero-supressed BDDs for set manipulation in combinatorial problems. In Proc. 30 th Design Automation Conf. (1993), pp. 272-277.
30. MOORE, J.S. Introduction to the OBDD algorithm for the ATP community. Technical Report 84, Computational Logic, Inc., Austin, Texas, Oct. 1992.
31. RAUZY, A. Using enumerative methods for Boolean unification. In [3]. MIT Press, 1993, ch. 13, pp. 237-251.
32. RAUZY, A. Notes on the design of an open Boolean solver. In Proc. Intl. Conf. on Logic Programming (1994). To appear.
33. RUDELL, R. Dynamic variable ordering for ordered binary decision diagrams. In IEEE Intl. Conf. on Computer-Aided Design (Nov. 1993), pp. 42-47.
34. SELMAN, B., LEVESQUE, I-I., AND MITCHELL, D. A new method for solving hard satisfiability problems. In Proc. 10 th Nat. Conf. on AI (July 1992), pp. 440-446.
35. SIMONIS, H., AND DINCBAS, M. Propositional calculus problems in CHIP. In [3]. MIT Press, 1993, ch. 15, pp. 269-285.
36. SLANEY, J. FINDER version 3.0 notes and guide. Technical report, Centre for Information Science Research, Australian National University, 1993.
37. SLANEY, J., FUJITA, M., AND STICKEL, M. Automated reasoning and exhaustive search: Quasigroup existence problems. Computers and Mathematics with Applications. To appear.
38. SUBRAMANIAN, S. A Mechanized Framework for Specifying Problem Domains and Verifying Plans. PhD thesis, Dept. of Comp. Science U. of Texas, Austin, 1993.
39. WALLACE, M. Personal communication. ECRC, Munich, Germany, July 1993.
40. WALSH, W. Personal communication. University of Edinburgh, Oct. 1993.
41. ZHANG, H. SATO: A decision procedure for propositional logic. Association for Automated Reasoning Newsletter, 22 (Mar. 1993), 1-3.
42. ZHANG, H., AND STICKEL, M. E. Implementing the Davis-Putnam algorithm by tries. Draft manuscript, Mar. 1994.