An Analysis of Some Relationships Between Post and Boolean Algebras
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Two-place decomposition and the synthesis of many-valued switching circuits
MVL '76 Proceedings of the sixth international symposium on Multiple-valued logic
Logic design of multi-valued I2L logic circuits
MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
Some I2L circuits for multiple-valued logic
MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
Decomposition of multiple-valued logic functions
MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
Multiple-valued combinational logic design using theorem proving
Multiple-valued combinational logic design using theorem proving
Problems and Experiments for and with Automated Theorem-Proving Programs
IEEE Transactions on Computers
Methods for Automated Theorem Proving in Nonclassical Logics
IEEE Transactions on Computers
Multivalued Integrated Injection Logic
IEEE Transactions on Computers
An Algorithm for NAND Decomposition Under Network Constraints
IEEE Transactions on Computers
A Stochastic Dynamic Local Search Method for Learning Multiple-Valued Logic Networks
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Automated reasoning: real uses and potential uses
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
| Hi-index | 14.98 |
This paper describes a method for the automatic synthesis of multiple-valued combinational logic circuits using automatic theorem proving techniques. Logic design of multiple-valued circuits is considerably more complex than binary design because of the associated combinatorial explosion. Two general approaches which can be taken in axiomatizing the environment of combinational logic design in multiple-valued logic have been investigated. These axiomatizations, formulated in the language of first order logic, are used to state the problem of combinational logic design as a theorem proving problem. This formulation together with a representation of the function being designed can be used as input to an automatic theorem proving program. The circuit design can then be obtained from the proof generated by the theorem prover.