It has been stated often in the past that practical acceptance of multi-valued logic awaits the development of suitable electronic means for fabricating a sufficiently powerful and general purpose logic. Though the search for such means has proceeded in parallel with every other development in the multivalued field in the last thirty years, there is reason to believe that the pace is quickening...

We propose a solution to the minimization problem of multiple-valued programmable logic arrays (PLA) that uses simulated annealing. The algorithm accepts a sum-ofproducts expression, divides and recombines the product terms. gradually progressing toward a minimal solution. The input expression can be user-specijied or one produced by another heuristic. Unlike recently studied minimization techn...

Three-level logic is shown to have a potential for reduction of the area over twolevel implementations, as well as for a gain in speed over multi-level implementations. In this paper we present an heuristic algorithm, AOXMIN-MV, targeting a three-level logic expression which is an XOR of two sum-of-products. For some practical functions, such an AND-OR-XOR expression may have up to 27 times les...

Abstract Algebraic Logic is a general theory of the algebraization of deductive systems arising as an abstraction of the well-known Lindenbaum-Tarski process. The notions of logical matrix and of Leibniz congruence are among its main building blocks. Its most successful part has been developed mainly by BLOK, PIGOZZI and CZELAKOWSKI, and obtains a deep theory and very nice and powerful results ...

Known upper bounds on the number of required nodes (size) in the ordered binary and multiple-valued decision diagram (DD) for representation of logic functions are reviewed and reduced by a small constant factor. New upper bounds are derived for partial logic functions containing don't cares and also for complete Boolean functions specified by Boolean expressions. The evaluation of upper bounds...