  The model set of a general Boolean function in CNF is calculated in a
compressed format, using novel wildcards. This method can be explained in very
visual ways. Preliminary comparison with existing methods (BDD's and
Mathematica's ESOP command) looks promising but our algorithm begs for a C
encoding which would render it comparable in more systematic ways.
