Conjunctive Normal Form Logic Formula
(Redirected from CNF)
Jump to navigation
Jump to search
A Conjunctive Normal Form Logic Formula is a Logic Sentence that is described as a Conjunction of Logic Clauses.
- AKA: CNF, Conjunctive Normal Form, Conjunctive Normal Form Formula, Conjunctive Normal Form Propositional Formula, Conjunctive Normal Form Logic Sentence, CNF Formula.
- Context:
- ?? Any Logic Sentence can be converted into a Conjunctive Normal Form Logic Sentence.
- It can be useful in automated theorem proving.
- Example(s):
- not A
- not A or B
- A and B
- (not A) and (B or C)
- (A or B) and (not B or C or not D).
- …
- Counter-Example(s):
- not(A or B) … this can be converted to (not A) and (not B) by De Morgan's Theorem.
- (A and B) or C
- (A and (B or (D and E))
- See: Disjunctive Normal Form Logic Formula, De Morgan's Theorem.