What is the subjunctive normal form?
Normal conjunctive form (CNF) is an approximation of that Boolean logicexpressing formulas as conjunctions of clauses with AND or OR. Any clause connected by a conjunction or AND must either be a literal or contain a disjunction or an OR operator. CNF is useful for automated theorem proofs.
In the conjunctive normal form, statements in Boolean logic are conjunctions of clauses with subsets of disjunctions. In other words, an instruction is a sequence of ORs linked by AND.
(A OR B) AND (C OR D)
(A OR B) AND (NOT C OR B)
The clauses can also be literals:
A OR B
A AND B
Literals are seen in CNF as conjunctions of literal clauses and conjunctions that happen to have a single clause. It is possible to convert instructions to CNF written in a different form, e.g. B. in the disjunctive normal form.