Disjunctive normal form
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
(Learn how and when to remove this template message)

In boolean logic, a disjunctive normal form (DNF) is a standardization (or normalization) of a logical formula which is a disjunction of conjunctive clauses; it can also be described as an OR of ANDs, a sum of products, or (in philosophical logic) a cluster concept. As a normal form, it is useful in automated theorem proving.
Contents
Definition
A logical formula is considered to be in DNF if and only if it is a disjunction of one or more conjunctions of one or more literals.^{[1]}^{:153} The conjunctions of a DNF formula are sometimes^{[citation needed]} called its clauses.^{[note 1]} A DNF formula is in full disjunctive normal form if each of its variables appears exactly once in every clause. As in conjunctive normal form (CNF), the only propositional operators in DNF are and, or, and not. The not operator can only be used as part of a literal, which means that it can only precede a propositional variable.
The following is a formal grammar for DNF:
 disjunction → (conjunction ∨ disjunction)
 disjunction → conjunction
 conjunction → (literal ∧ conjunction)
 conjunction → literal
 literal → ¬variable
 literal → variable
Where variable is any variable.
For example, all of the following formulae are in DNF:
However, the following formulae are not in DNF:
 , since an OR is nested within a NOT
 , since an OR is nested within an AND
Conversion to DNF
Converting a formula to DNF involves using logical equivalences, such as the double negative elimination, De Morgan's laws, and the distributive law.
All logical formulas can be converted into an equivalent disjunctive normal form.^{[1]}^{:152153} However, in some cases conversion to DNF can lead to an exponential explosion of the formula. For example, the DNF of a logical formula of the following form has 2^{n} terms:
Any particular Boolean function can be represented by one and only one^{[note 2]} full disjunctive normal form, one of the canonical forms. In contrast, two different plain disjunctive normal forms may denote the same Boolean function, see pictures.
Complexity issues
An important variation used in the study of computational complexity is kDNF. A formula is in kDNF if it is in DNF and each clause contains at most k literals. Dually to CNFs, the problem of deciding whether a given DNF is true for every variable assignment is NPcomplete, the same holds if only kDNFs are considered.
See also
 Algebraic normal form
 Boolean function
 Booleanvalued function
 Conjunctive normal form
 Horn clause
 Karnaugh map
 Logical graph
 Propositional logic
 Quine–McCluskey algorithm
 Truth table
Notes
 ^ This notion shouldn't be confused with the (more common) notion of the clauses of a conjunctive normal form, which means its disjunctions.
 ^ Ignoring variations based on associativity and commutativity of AND and OR.
References
External links
 Hazewinkel, Michiel, ed. (2001) [1994], "Disjunctive normal form", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 9781556080104