Calculate The Conjunctive Normal Form of The Following Logic Expression

Conjunctive Normal Form (CNF) is a standard form in boolean algebra where a logical expression is written as a conjunction (AND) of disjunctions (OR) of literals. This calculator helps you convert any logic expression into its CNF form.

What is Conjunctive Normal Form?

Conjunctive Normal Form is a canonical form used in boolean algebra and digital logic. A boolean expression is in CNF if it is a conjunction (AND) of one or more clauses, where each clause is a disjunction (OR) of one or more literals.

Formally, a literal is either a variable or its negation. A clause is a disjunction of literals, and a CNF is a conjunction of clauses. For example, (A ∨ B) ∧ (¬A ∨ C) is in CNF.

CNF is important in computer science because it's used in algorithms for satisfiability (SAT) problems, logic synthesis, and automated theorem proving.

How to Convert to CNF

Converting an expression to CNF involves several steps:

Eliminate implications (→, ↔)
Move negation inward using De Morgan's laws
Distribute OR over AND
Combine like terms

Example conversion steps:

Original: (A → B) ∧ (C ∨ ¬D)

Step 1: ¬A ∨ B ∧ (C ∨ ¬D)

Step 2: (¬A ∨ B) ∧ (C ∨ ¬D)

Final CNF: (¬A ∨ B) ∧ (C ∨ ¬D)

The calculator automates these steps for you, handling complex expressions with multiple variables and operators.

Worked Example

Let's convert the expression (A ∧ B) ∨ (¬A ∧ C) to CNF:

Original: (A ∧ B) ∨ (¬A ∧ C)
Distribute OR over AND: (A ∨ ¬A ∧ C) ∧ (B ∨ ¬A ∧ C)
Simplify (A ∨ ¬A) to true: (true ∧ C) ∧ (B ∨ ¬A ∧ C)
Final CNF: C ∧ (B ∨ ¬A)

Note that the calculator will handle these steps automatically for any input expression.

FAQ

What is the difference between CNF and DNF?: CNF is a conjunction of disjunctions, while DNF (Disjunctive Normal Form) is a disjunction of conjunctions. They are dual forms used in different contexts.
Can all boolean expressions be converted to CNF?: Yes, every boolean expression can be converted to CNF using the standard conversion rules.
Why is CNF important in computer science?: CNF is used in algorithms for SAT problems, logic synthesis, and automated theorem proving because it provides a standard form for analysis.
What happens if I enter an invalid expression?: The calculator will display an error message explaining the issue and suggest corrections.