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:
“The normal present connects the past and the future through limitation. Contiguity results, crystallization by means of solidification. There also exists, however, a spiritual present that identifies past and future through dissolution, and this mixture is the element, the atmosphere of the poet.”
—Novalis [Friedrich Von Hardenberg] (1772–1801)
“I have discovered the most exciting, the most arduous literary form of all, the most difficult to master, the most pregnant in curious possibilities. I mean the advertisement.... It is far easier to write ten passably effective Sonnets, good enough to take in the not too inquiring critic, than one effective advertisement that will take in a few thousand of the uncritical buying public.”
—Aldous Huxley (1894–1963)