Conjunctive normal form represents a Boolean formula as an AND of one or more OR clauses.
What Is Conjunctive Normal Form?
Conjunctive normal form represents a Boolean formula as an AND of one or more OR clauses.
Examples of Conjunctive Normal Form
1
(p∨q) ∧ (¬p∨r) is in CNF.Formula and Key Points
Formula / rule
AND of OR-clauses
- Know the definition and standard notation for Conjunctive Normal Form.
- Be able to recognise or compute conjunctive normal form in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used in program conditions, digital circuits, database queries, formal verification, search and decision logic. CNF is the standard input representation for many SAT solvers.
Related Math Terms
Conjunctive Normal Form: Frequently Asked Questions
What is Conjunctive Normal Form?
Conjunctive normal form represents a Boolean formula as an AND of one or more OR clauses.
Why is Conjunctive Normal Form useful in computer science?
Used in program conditions, digital circuits, database queries, formal verification, search and decision logic. CNF is the standard input representation for many SAT solvers.