Question: Consider the following algorithm for checking satisfiability: Put the formula into disjunctive normal form and then check to see if all of the disjuncts

Consider the following algorithm for checking satisfiability: Put the formula into disjunctive

Consider the following algorithm for checking satisfiability: Put the formula into disjunctive normal form and then check to see if all of the disjuncts are contradictions (containing both a variable and its complement). If not, then it is satisfiable. Why is this algorithm exponentially costly?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!