- Disjunctive Normal Forms (DNF) :
A formula which is equivalent to a given formula and which consists of a sum of elementary products is called a disjunctive normal form of given formula.
(P ∧ ~ Q) ∨ (Q ∧ R) ∨ (~ P ∧ Q ∧~ R)
- The DNF of formula is not unique.
- Conjunctive Normal Form (CNF) :
A formula which is equivalent to a given formula and which consists of a product of elementary products is called a conjunctive normal form of given formula.
(P~ ∨ Q) ∧ (Q ∨ R) ∧ (~ P ∨ Q ∨ ~ R)
- The CNF of formula is not unique.
- If every elementary sum in CNF is tautology, then given formula is also tautology.
- Principle Disjunctive Normal Form (PDNF) :
An equivalent formula consisting of disjunctions of minterms only is called the principle disjunctive normal form of the formula.
It is also known as sum-of-products canonical form.
(P ∧ ~ Q ∧ ~ R) ∨ (P ∧ ~ Q ∧ R) ∨ (~ P ∧ ~ Q ∧ ~ R)
- The minterm consists of conjunctions in which each statement variable or its negation, but not both, appears only once.
- The minterms are written down by including the variable if its truth value is T and its negation if its truth value is F.
- Principle Conjunctive Normal Form (PCNF) :
An equivalent formula consisting of conjunctions of maxterms only is called the principle conjunctive normal form of the formula.
It is also known as product-of-sums canonical form.
(P ∨ ~ Q ∨ ~ R) ∧ (P ∨ ~ Q ∨ R) ∧ (~ P ∨ ~ Q ∨ ~ R)
- The maxterm consists of disjunctions in which each variable or its negation, but not both, appears only once.
- The dual of a minterm is called a maxterm.
- Each of the maxterm has the truth value F for exactly one combination of the truth values of the variables.
- The maxterms are written down by including the variable if its truth value is F and its negation if its truth value is T.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Normal Forms in DBMS
- Allowed Functional Dependencies (FD) in Various Normal Forms (NF)
- Principle of programming languages | Set 1
- Mathematics | The Pigeonhole Principle
- Introduction of 4th and 5th Normal form in DBMS
- How to find the highest normal form of a relation
- Converting Context Free Grammar to Chomsky Normal Form
- Mathematics | Probability Distributions Set 3 (Normal Distribution)
- Converting Context Free Grammar to Greibach Normal Form
- Minimum relations satisfying First Normal Form (1NF)
- Domain Key Normal Form in DBMS
- Second Normal Form (2NF)
- Third Normal Form (3NF)
- Boyce-Codd Normal Form (BCNF)
- First Normal Form (1NF)
- Indeterminate Forms
- Univariate, Bivariate and Multivariate data and its analysis
- Difference between Stop and Wait, GoBackN and Selective Repeat
- Difference between Stop and Wait protocol and Sliding Window protocol
- Stop and Wait protocol, its problems and solutions
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.