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:
“Cant is always rather nauseating; but before we condemn political hypocrisy, let us remember that it is the tribute paid by men of leather to men of God, and that the acting of the part of someone better than oneself may actually commit one to a course of behaviour perceptibly less evil than what would be normal and natural in an avowed cynic.”
—Aldous Huxley (1894–1963)
“The door is opening. A man you have never seen enters the room.
He tells you that it is time to go, but that you may stay,
If you wish. You reply that it is one and the same to you.
It was only later, after the house had materialized elsewhere,
That you remembered you forgot to ask him what form the change would take.”
—John Ashbery (b. 1927)