First page Back Continue Last page Summary Graphics
Example: 3-SAT
Consider a proposition in Boolean variables:
¬(AœBœCœD) œ (AB)
All such can be transformed to ``Conjunctive Normal Form'' (CNF):
(¬A¬B¬C¬D) œ (AB)
And clauses of length > 3 eliminated:
(¬A¬BX) œ (¬C¬D¬X) œ (AB)
Result: ``3-SAT'' problem