1. Gupta, A. (1994): Inductive Boolean Function Manipulation: A Hardware Verifieation Methodology tor Automatic Induction. Ph.D. Thesis, CMU, Pittsburgh.
2. Boyer, R.S., and Moore, J.S. (1988): A Computational Logic Handbook. Academic Press.
3. Boyer, R.S., and Moore, J.S. (1988): “Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic”, Machine Intelligence 11, P. Hayes, D. Mitchie and J. Richards (eds).
4. Bryant, R.E. (1986): “Graph-based algorithms for boolean function manipulation,” IEEE Trans. on Computers, C-35(8).
5. Dershowitz, N. (1986): “Termination of rewriting,” J. Symbolic Computation, 3, 69–116.