Abstract
A binary-decision program is a program consisting of a string of two-address conditional transfer instructions. The paper shows the relationship between switching circuits and binary-decision programs and gives a set of simple rules by which one can transform binary-decision programs to switching circuits. It then shows that, in regard to the computation of switching functions, binary-decision programming representation is superior to the usual Boolean representation.
Keywords
Binary decision diagramBinary numberRepresentation (politics)Boolean functionSet (abstract data type)Computer scienceTheoretical computer scienceElectronic circuitSimple (philosophy)Decision ruleAlgorithmMathematicsArithmeticArtificial intelligenceProgramming languageEngineeringElectrical engineering
Related Publications
Outline of a New Approach to the Analysis of Complex Systems and Decision Processes
The approach described in this paper represents a substantive departure from the conventional quantitative techniques of system analysis. It has three main distinguishing featur...
Structure and chance
Software errors abound in the world of computing. Sophisticated computer programs rank high on the list of the most complex systems ever created by humankind. The complexity of ...
A Structure for Plans and Behavior
This report describes progress to date in the ability of a computer system to understand and reason about actions. A new method of representing actions within a computer's memor...
Publication Info
- Year
- 1959
- Type
- article
- Volume
- 38
- Issue
- 4
- Pages
- 985-999
- Citations
- 687
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
687
OpenAlex
Cite This
C. Y. Lee
(1959).
Representation of Switching Circuits by Binary-Decision Programs.
Bell System Technical Journal
, 38
(4)
, 985-999.
https://doi.org/10.1002/j.1538-7305.1959.tb01585.x
Identifiers
- DOI
- 10.1002/j.1538-7305.1959.tb01585.x