• Corpus ID: 112935883

Algebraic minimization and the design of two-terminal contact networks

@inproceedings{McCluskey1956AlgebraicMA,
  title={Algebraic minimization and the design of two-terminal contact networks},
  author={Edward Joseph McCluskey},
  year={1956}
}
Thesis (Sc.D.) Massachusetts Institute of Technology. Dept. of Electrical Engineering, 1956. 
Publications in the First Twenty Years of Switching Theory and Logic Design
This paper reviews publications in switching theory and logic design up to 1958, including both mathematical foundations and engineering applications.
Pathfinding through a communication network
TLDR
Using the proposed technique, paths of increasing length can be found sequentially and all paths of exactly q branches interconnecting a given source-sink node pair can be obtained.
Automated Synthesis of Memristor Crossbar Networks
TLDR
This dissertation attempts to answer the following questions and presents novel solutions to each, and resolves a number of significant bottlenecks in existing research, via the usage of innovative logic representation and artificial intelligence techniques.
Automated Synthesis of Memristor Crossbar Networks 2019
TLDR
This dissertation attempts to answer the following questions and presents novel solutions to each, and resolves a number of significant bottlenecks in existing research, via the usage of innovative logic representation and artificial intelligence techniques.
Hybrid intelligent systems for pneumatic sequential circuit design: Hybridizing genetic algorithms and rule-based logic programming
  • G. Sajaysurya, G. S. Kumar
  • Computer Science, Engineering
    2011 11th International Conference on Hybrid Intelligent Systems (HIS)
  • 2011
TLDR
The proposed system hybridizes rule based logic programming and genetic algorithms and is capable of solving considerably difficult problems through an evolutionary strategy in logic synthesis for industrial automation systems using pneumatic sequential circuits.
An Iterative Technique for Improved Two-level Logic Minimization
TLDR
This paper describes an iterative heuristic technique to improve the quality of results obtained during two-level logic minimization using ESPRESSO, and shows that with a small number of iterations, this technique is able to improve on the number of cubes in the solution, with an acceptable run-time overhead.
Computer Supported Activity Coordination
TLDR
This work proposes the modeling of the discussion activities of a study group using an activities coordination model and using coordination mechanisms based on Petri Nets, the behavior of the environment can be simulated and analyzed.
Fuzzy classifiers and their relation to cluster analysis and neural networks
TLDR
This work shows that the fuzzy max-min classifier decides locally on the basis of two attributes, i.e. only a separation between classes that is parallel to n-2 coordinates can be represented, and geometrically characterize and visualize the Lukasiewicz-classifier.
A logic programming system for nonmonotonic reasoning
TLDR
This paper presents and exploits a SLDNF-like derivation procedure, SLX, for programs with explicit negation under well-founded semantics (WFSX) and proves its soundness and completeness and introduces a paraconsistent version of WFSX that allows contradictions and for which the SLX top-down procedure is proven correct as well.
...
...

References

SHOWING 1-10 OF 11 REFERENCES
Boolean matrices and the design of combinational relay switching circuits
TLDR
The properties of these “switching matrices” are studied, and examples are given to show how they may be employed effectively in the design of switching circuits.
The Problem of Simplifying Truth Functions
TLDR
The Problem of Simplifying Truth Functions is concerned with the problem of reducing the number of operations on a graph to a simple number.
The synthesis of two-terminal switching circuits
TLDR
A basic part of the general synthesis problem is the design of a two-terminal network with given operating characteristics, and this work shall consider some aspects of this problem.
The map method for synthesis of combinational logic circuits
  • M. Karnaugh
  • Computer Science
    Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics
  • 1953
TLDR
The problem in this area which has been attacked most energetically is that of the synthesis of efficient combinational that is, nonsequential, logic circuits.
Sketch for an algebra of relay and contactor circuits
TLDR
Methods whereby complex circuits may be simplified by algebraic manipulation of the symbolic expressions are described; and design of relay circuits to perform given operations is discussed.
A symbolic analysis of relay and switching circuits
  • C. Shannon
  • Mathematics
    Transactions of the American Institute of Electrical Engineers
  • 1938
TLDR
It will be shown that several of the well-known theorems on impedance networks have roughly analogous theorem in relay circuits, including the delta-wye and star-mesh transformations, and the duality theorem.
Switching Circuits and Logical Systems, Teaching Notes for Course 6
  • Switching Circuits and Logical Systems, Teaching Notes for Course 6
...
...