Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Programming in Prolog (3rd ed.)
Programming in Prolog (3rd ed.)
Digital integrated circuits: a design perspective
Digital integrated circuits: a design perspective
Logic Design of Digital Systems
Logic Design of Digital Systems
Cyclic combinational circuits
IEEE Transactions on Information Theory
Synthesis of reversible logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Revisiting exact combinational circuit synthesis
Proceedings of the 2008 ACM symposium on Applied computing
Exact combinational logic synthesis and non-standard circuit design
Proceedings of the 5th conference on Computing frontiers
Symbolic modeling of a universal reconfigurable logic gate and its applications to circuit synthesis
Proceedings of the 2012 ACM Research in Applied Computation Symposium
| Hi-index | 0.01 |
Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts to reconnect the two fields with a fresh look at Prolog encodings for the combinatorial objects involved in circuit synthesis. While benefiting from Prolog's fast unification algorithm and built-in backtracking mechanism, efficiency of our search algorithm is ensured by using parallel bitstring operations together with logic variable equality propagation, as a mapping mechanism from primary inputs to the leaves of candidate Leaf-DAGs implementing a combinational circuit specification. After an exhaustive expressiveness comparison of various minimal libraries, a surprising first-runner, Strict Boolean Inequality "