Conjunctive Normal Form
In Boolean logic, a formula is in conjunctive normal form (CNF) if it is a conjunction of clauses, where a clause is a disjunction of literals. As a normal form, it is useful in automated theorem proving. It is similar to the product of sums form used in circuit theory.
All conjunctions of literals and all disjunctions of literals are in CNF, as they can be seen as conjunctions of one-literal clauses and conjunctions of a single clause, respectively. As in the disjunctive normal form (DNF), the only propositional connectives a formula in CNF can contain are and, or, and not. The not operator can only be used as part of a literal, which means that it can only precede a propositional variable.
Read more about Conjunctive Normal Form: Examples and Counterexamples, Conversion Into CNF, First-order Logic, Computational Complexity, Converting From First-order Logic
Famous quotes containing the words normal and/or form:
“We have been weakened in our resistance to the professional anti-Communists because we know in our hearts that our so-called democracy has excluded millions of citizens from a normal life and the normal American privileges of health, housing and education.”
—Agnes E. Meyer (1887–1970)
“During the long ages of class rule, which are just beginning to cease, only one form of sovereignty has been assigned to all men—that, namely, over all women. Upon these feeble and inferior companions all men were permitted to avenge the indignities they suffered from so many men to whom they were forced to submit.”
—Mary Putnam Jacobi (1842–1906)