This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
W.S. Wojciechowski, SEI Information Technology
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.
Index Terms:
theorem proving, Automated design, first order logic, formal proof, logic design, multiple-valued circuits
Citation:
W.S. Wojciechowski, A.S. Wojcik, "Automated Design of Multiple-Valued Logic Circuits by Automatic Theorem Proving Techniques," IEEE Transactions on Computers, vol. 32, no. 9, pp. 785-798, Sept. 1983, doi:10.1109/TC.1983.1676328
Usage of this product signifies your acceptance of the Terms of Use.