finds a minimal-length disjunctive normal form representation of expr.
finds a minimal-length representation for expr in the specified form.
finds a minimal-length expression in the specified form that is equivalent to expr when cond is true.
Details and Options
- BooleanMinimize[expr,form] always produces an expression equivalent to expr.
- Available forms are:
"DNF","SOP" disjunctive normal form, sum of products "CNF","POS" conjunctive normal form, product of sums "ANF" algebraic normal form "NOR" two-level Nor and Not "NAND" two-level Nand and Not "AND" two-level And and Not "OR" two-level Or and Not
- In general, there may be several minimal-length representations for a particular expression in a certain form. BooleanMinimize gives one of them.
- BooleanMinimize supports a Method option that specifies the detailed method to use.
Examplesopen allclose all
Basic Examples (2)
Properties & Relations (4)
The output from BooleanMinimize is equivalent to its input:
The output from BooleanMinimize with condition is conditionally equivalent to its input:
BooleanMinimize will produce an expression of length 3:
Use BooleanConvert when the minimal length form is not required:
BooleanConvert can also convert to additional forms: