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.

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

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.

The International SAT Solver Competitions

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.

Planning in the Fluent Calculus Using Binary Decision Diagrams

All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.