CNF-Satisfiability

• Input: A Boolean formula F in conjunctive normal form.

• Output: Determine if F is satisfiable, that is, there is some assignment to the variables that makes the formula F true.

• Algorithm: Guess an assignment and check it.

Previous slide

Next slide

Back to first slide

View graphic version