English Wikipedia - The Free Encycl...
Download this dictionary
Conjunctive normal form
In
Boolean logic
, a
formula
is in
conjunctive normal form (CNF)
or
clausal normal form
if it is a
conjunction
of
clauses
, where a clause is a
disjunction
of
literal
s; otherwise put, it is
an AND of ORs
. As a normal form, it is useful in
automated theorem proving
. It is similar to the
product of sums form
used in
circuit theory
.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License