conjunctive normal form

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