Proving with BDDs and control of information
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 499-513
- https://doi.org/10.1007/3-540-58156-1_36
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The complexity of resource-bounded first-order classical logicPublished by Springer Nature ,1994
- SATCHMO: A theorem prover implemented in PrologPublished by Springer Nature ,1987
- Automated Theorem ProvingPublished by Springer Nature ,1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Seventy-five problems for testing automatic theorem proversJournal of Automated Reasoning, 1986
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Theorem Proving via General MatingsJournal of the ACM, 1981
- A Proof Procedure Using Connection GraphsJournal of the ACM, 1975
- Linear resolution with selection functionArtificial Intelligence, 1972
- Efficiency and Completeness of the Set of Support Strategy in Theorem ProvingJournal of the ACM, 1965