Disjunctive normal form represents a Boolean formula as an OR of one or more AND terms.
What Is Disjunctive Normal Form?
Disjunctive normal form represents a Boolean formula as an OR of one or more AND terms.
Examples of Disjunctive Normal Form
1
(p∧q) ∨ (¬p∧r) is in DNF.Formula and Key Points
Formula / rule
OR of AND-terms
- Know the definition and standard notation for Disjunctive Normal Form.
- Be able to recognise or compute disjunctive 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. DNF is useful for representing rule sets and Boolean conditions as alternative cases.
Related Math Terms
Disjunctive Normal Form: Frequently Asked Questions
What is Disjunctive Normal Form?
Disjunctive normal form represents a Boolean formula as an OR of one or more AND terms.
Why is Disjunctive Normal Form useful in computer science?
Used in program conditions, digital circuits, database queries, formal verification, search and decision logic. DNF is useful for representing rule sets and Boolean conditions as alternative cases.