The form of a logical expression consisting of a single conjunction (ยท) of a set of disjunctions(+). All logical expressions are expressible in this form.

a standard form for logical expressions, in which individual terms are joined by AND, and such groups of terms are joined by OR.

A Boolean expression having junctors in {AND, OR} is in Disjunctive Normal Form if no junctors are negated and if no OR junctor is dominated by an AND junctor.

Data descriptions comprising a disjunction of conjunctions of features, such as "all text with (pointsize=12 and font=Times) or (pointsize=10 and font=Helvetica)." Each conjunction (in parentheses) is called a "disjunct." This is the most general logical form of data description, because a DNF can describe any subset of the universe of objects implied by a given feature bias. The number of DNF's is exponential and so finding the simplest DNF is intractable, but greedy polynomial learning algorithms, such as ID3 [Quinlan 86], can efficiently learn descriptions having more disjuncts than necessary.

Refers to an order of logical equations where there is a disjunction of conjunctions and no conjunction contains a disjunction. For example the DNF of ((A OR B) AND C) would be ((A AND C) OR (B AND C)).

In boolean logic, a disjunctive normal form (DNF) is a standardization (or normalization) of a logical formula which is a disjunction of conjunctive clauses. As a normal form, it is useful in automated theorem proving. 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.