# Conjunctive Normal Form

Also found in: Acronyms, Wikipedia.

## Conjunctive Normal Form

(logic)
(CNF) A logical formula consisting of a conjunction of disjunctions of terms where no disjunction contains a conjunction. Such a formula might also be described as a product of sums. E.g. the CNF of

(A and B) or C is (A or C) and (B or C).

Contrast Disjunctive Normal Form.
Mentioned in ?
References in periodicals archive ?
In the main track of the competition, the goal is to determine whether a given SAT instance in conjunctive normal form is satisfiable or not as quickly as possible.
F is a Boolean formula in its conjunctive normal form (called system SAT) if F = ?
The use of BDDs can lead to exponential savings in space in comparison to representations such as decision trees or disjunctive or conjunctive normal form. In practical applications, logical operations on a BDD representation are often much more efficient than in these other representations.

Site: Follow: Share:
Open / Close