Title :
Lukasiewicz logic arrays
Author :
Mills, Jonathan Wayne ; Beavers, M. Gordon ; Daffinger, Charles A.
Author_Institution :
Indiana Univ., Bloomington, IN, USA
Abstract :
Lukasiewicz logic arrays (LLAs) are massively parallel analog computers organized as binary trees of identical processing elements performing either implication, negated implication, or both. The authors have designed and built working 31-cell CMOS VLSI LLA whose cells perform implication. They discuss the representation completeness of Lukasiewicz logic with respect to other multiple-valued logics; describe the architecture of the prototype LLA, its relationship to cellular automata and its VLSI implementation; show how the prototype LLA is programmed; and report on results obtained by programming the prototype LLA as a fuzzy function generator. Because LLAs have both an algebraic and a logical operational semantics, they can be used to implement approximate reasoning systems, including expert systems and neural networks
Keywords :
logic arrays; many-valued logics; CMOS VLSI LLA; LLAs; Lukasiewicz logic arrays; cellular automata; fuzzy function generator; implication; representation completeness; Analog computers; Automatic programming; Binary trees; CMOS logic circuits; Computer architecture; Fuzzy logic; Logic arrays; Logic programming; Prototypes; Very large scale integration;
Conference_Titel :
Multiple-Valued Logic, 1990., Proceedings of the Twentieth International Symposium on
Conference_Location :
Charlotte, NC
Print_ISBN :
0-8186-2046-3
DOI :
10.1109/ISMVL.1990.122584