The minimal solutions of:
It gets complicated if ATOMs are repeated, so you'll have to compute all possible solutions to find the minimas.
e.g. min ( ( a or b ) and ( a or c ) ) = { {a} } cause {a} x {a} = {a} and the other solutions like {b,a}, etc are bigger
HTH! :)
Cheers Rolf
( addicted to the Perl Programming Language)
In reply to Re: Walking a boolean tree to produce matching inputs
by LanX
in thread Walking a boolean tree to produce matching inputs
by japhy
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |