Learn More
A new algorithm for testing satissability of propositional formulas in conjunctive normal form (CNF) is described. It applies reasoning in the form of certain resolution operations, and identiication of equivalent literals. Resolution produces growth in the size of the formula, but within a global quadratic bound; most previous methods avoid operations that(More)
Recent successes with incomplete satissability procedures raise numerous issues about their uses and evaluation. Most such procedures search for yes" answers, and give up if they do not nd one. The need for no" answers as well is addressed. It is shown that a recent approximation algorithm of Yannakakis can produce no" answers only in somewhat trivial(More)
  • 1