Revisiting exact combinational circuit synthesis

Authors:
Paul Tarau;Brenda Luderman
Affiliations:
University of North Texas;Intel Corp., Austin, Texas
Venue:
Proceedings of the 2008 ACM symposium on Applied computing
Year:
2008

Citing 3
Cited 1

Cyclic combinational circuits

Cyclic combinational circuits
The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)

The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)
A logic programming framework for combinational circuit synthesis

ICLP'07 Proceedings of the 23rd international conference on Logic programming

Exact combinational logic synthesis and non-standard circuit design

Proceedings of the 5th conference on Computing frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 "