MODELING AND VERIFYING SYSTEMS AND SOFTWARE IN PROPOSITIONAL LOGIC

This publication has 4 references indexed in Scilit:

• A note on the computational complexity of the pure classical implication calculus
  Information Processing Letters, 1989
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• A symbolic analysis of relay and switching circuits
  Transactions of the American Institute of Electrical Engineers, 1938