What is "disjunctive normal form"

n. (context logic English) The form of a boolean formula that the formula has if the formula is a disjunction of conjunctions of literals, such as "(A and B and C) or (D and E and not F)".

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.