disjunctive normal form

A normal form where formulas are represented as “or”s of “and”s of literals. DNF is also called “sum-of-products.” Each formula connected by $\vee$ is called a “disjunct.” An example would be $(p\wedge \neg q\wedge r)\vee (\neg s\wedge t)$, where $(p\wedge \neg q\wedge r)$ and $\neg s\wedge t$ are disjuncts. Note that a disjunct can just be a single propositional variable as well.