Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The 1999 ICFP programming contest
ACM SIGPLAN Notices
Linear lambda calculus and PTIME-completeness
Journal of Functional Programming
| Hi-index | 0.00 |
This work presents simple decision procedures for the propositional calculus and for a simple predicate calculus. These decision procedures are based upon enumeration of the possible values of the variables in an expression. Yet, by taking advantage of the sequential semantics of boolean connectors, not all values are enumerated. In some cases, dramatic savings of machine time can be achieved. In particular, an equivalence checker for a small programming language appears to be usable in practice.