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:
“You have promise, Mlle. Dubois, but you must choose between an operatic career and what is usually called “a normal life.” Though why it is so called is beyond me.”
—Eric Taylor, Leroux, and Arthur Lubin. M. Villeneuve (Frank Puglia)
“The old idea that the joke was not good enough for the company has been superseded by the new aristocratic idea that the company was not worthy of the joke. They have introduced an almost insane individualism into that one form of intercourse which is specially and uproariously communal. They have made even levities into secrets. They have made laughter lonelier than tears.”
—Gilbert Keith Chesterton (1874–1936)