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:
“To try to control a nine-month-old’s clinginess by forcing him away is a mistake, because it counteracts a normal part of the child’s development. To think that the child is clinging to you because he is spoiled is nonsense. Clinginess is not a discipline issue, at least not in the sense of correcting a wrongdoing.”
—Lawrence Balter (20th century)
“When the delicious beauty of lineaments loses its power, it is because a more delicious beauty has appeared; that an interior and durable form has been disclosed.”
—Ralph Waldo Emerson (1803–1882)