Stålmarck’s algorithm as a HOL derived rule
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 221-234
- https://doi.org/10.1007/bfb0105407
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Hiding propositional constants in BDDsFormal Methods in System Design, 1996
- Binary Decision Diagrams as a HOL derived ruleThe Computer Journal, 1995
- Proving formulas through reduction to decidable classesPublished by Springer Nature ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- MODELING AND VERIFYING SYSTEMS AND SOFTWARE IN PROPOSITIONAL LOGICPublished by Elsevier ,1990
- Computation-oriented reductions of predicate to propositional logicDecision Support Systems, 1988
- A quantitative approach to logical inferenceDecision Support Systems, 1988
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Zum Entscheidungsproblem der mathematischen LogikMathematische Annalen, 1928