🚀 go-pugleaf

In article <1992Dec8.212333.39513@ns1.cc.lehigh.edu> sh09@ns1.cc.lehigh.edu (STEVEN HIGGINS) writes:
>
>    A while back, somebody was looking for a program to assist in the
>    simplification of Boolean expressions.  I was wondering if they had
>    any luck, and would be grateful if you could forward me info on any FTP
>    sites that would have such a program.
>
>    Thanks,
>
>
>    
>-- 
>
>~Steve
>sh09@lehigh.edu

An alpha release of our combinational network design tool,
cnd, is available on ftp.

This release of cnd minimizes single-output, two-valued-logic
functions of n variables, n <= 32.

TO START

  Use "anonymous" ftp login to acs.msu.edu (35.8.56.90).
  
  Ftp the executable(binary) and the sample data.

  The program cnd is in the pub/arch subdirectory.

  Only the binaries are being distributed--remember to set
  ftp mode to "binary".

 THEN (uncompress, if necessary):

 >$ cnd -c <cnd.data | more

The documentation relates to usage only, and is available
only in compressed PostScript-format (-.ps.Z).


A PC version of our combinational network
design tool, cnd, is also available.

This release of cnd minimizes single-output, two-valued-logic
functions of n variables, n <= 16.

The executables for the PC and Sun-SPARC are available now. 

Let me know of any problems or successes you have.

Thanks,

Dick

reid@cps.msu.edu