Back Forma normal conjuntiva Catalan Konjunktivní normální forma Czech Konjunktive Normalform German Forma normal conjuntiva Spanish فرم نرمال اشتراکی Persian Forme normale conjonctive French CNF HE Konjunktív normálforma Hungarian Կոնյունկտիվ նորմալ ձև Armenian Forma normale congiuntiva Italian
In Boolean logic, a formula is in conjunctive normal form (CNF) or clausal normal form if it is a conjunction of one or more clauses, where a clause is a disjunction of literals; otherwise put, it is a product of sums or an AND of ORs. As a canonical normal form, it is useful in automated theorem proving and circuit theory.
In automated theorem proving, the notion "clausal normal form" is often used in a narrower sense, meaning a particular representation of a CNF formula as a set of sets of literals.