Evaluate Boolean Expression

Reduce a Boolean expression to its minimal form by parsing it into canonical notation, constructing a truth table, applying algebraic simplification laws, performing Karnaugh map minimization (up to six variables), and verifying that the simplified expression is logically equivalent to the original.

When to Use

• Simplifying a Boolean expression before mapping it to logic gates
• Verifying that two Boolean expressions are logically equivalent
• Generating a minimal sum-of-products (SOP) or product-of-sums (POS) form
• Teaching or reviewing Boolean algebra identities and reduction techniques
• Preparing input for the design-logic-circuit skill

Inputs

• Required: Boolean expression in any common notation (e.g., A AND (B OR NOT C), A * (B + C'), A & (B | ~C))
• Required: Target form -- minimal SOP, minimal POS, or both
• Optional: Variable ordering preference for the Karnaugh map
• Optional: Don't-care conditions (minterms or maxterms that are unspecified)
• Optional: A second expression to check equivalence against