revisiting exact combinational circuit synthesis
The paper revisits exact combinational circuit synthesis with logic programming tools. Our focus is finding a minimal cost circuit that matches a specification - a notoriously hard nondeterministic search problem. After an exhaustive expressiveness comparison of various minimal libraries, two asymmetrical operations, Logical Implication "?" and Strict Boolean Inequality "<" turn out to consistently outperform their more popular symmetrical couterparts NAND and NOR, while having comparably small transistor count implementations. The code of the synthetizer and various libraries is available at http://logic.csci.unt.edu/tarau/research/2007/Isyn.zip.
exact combinational circuit synthesis logic programming and circuit design