does anybody have any (lisp?!) code that does boolean function minimization,
e.g.:
p+~p --> true
(a&b)+~a --> b+~a
(~a&~b&c)+(~a&b&c)+(a&~b&c)+(a&b&c) --> c
ideally, both the input and output should be in s-o-p form, like my examples.
thanks!
-- Nick
····@skate.cs.washington.edu (Nicholas Kushmerick) writes:
>does anybody have any (lisp?!) code that does boolean function minimization,
>e.g.:
> p+~p --> true
> (a&b)+~a --> b+~a
> (~a&~b&c)+(~a&b&c)+(a&~b&c)+(a&b&c) --> c
>ideally, both the input and output should be in s-o-p form, like my examples.
There's a REDUCE (3.3) program which was some time ago on the netlib at
rand.org which does a similar job (I'm not sure how good). If you are
interested, please e-mail. Name of the program was "PMRULES", if I remember
right.
--
Hartmut Frommert, Physics, Univ of Constance, | + Whale killing is murder. +
P.O.Box 55 60, D-W-7750 Konstanz, Germany | + Eat whale killers, not whales.
E-Mail: <······@dknkurz1.bitnet> or <······@nyx.uni-konstanz.de>
+ "Windows NoT" expands in German to "Windows Noch Teurer"
+ ^even ^more expensive