Algebraic methods for multi-valued logic

We give several algebraic (more correctly semialgebraic) methods for manipulating multi-valued logic functions. The methods treat binary and multi-valued variables uniformly. They include methods for finding common sub-expressions, semi-algebraic division, decom posing a multi-valued network using kernel extraction, factoring an expression, and simplifying a factored form using "redundant values". The algorithms have been im plemented in a prototype system (in APL) and tested for quality (not speed) on a small set of made-up examples. The methods seem to worksatisfactorily but more exper imentation needs to be done.

[1]  Robert K. Brayton,et al.  MIS-MV: optimization of multi-level logic with multiple-values inputs , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[2]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[3]  R. Brayton,et al.  B L F-M V An Interchange Format for Design Verification and Synthesis , 1991 .

[4]  Janusz Rajski,et al.  A method for concurrent decomposition and factorization of Boolean expressions , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.