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:
“I shouldn’t say I’m looking forward to leading a normal life, because I don’t know what normal is. This has been normal for me.”
—Martina Navratilova (b. 1956)
“Women over fifty already form one of the largest groups in the population structure of the western world. As long as they like themselves, they will not be an oppressed minority. In order to like themselves they must reject trivialization by others of who and what they are. A grown woman should not have to masquerade as a girl in order to remain in the land of the living.”
—Germaine Greer (b. 1939)