William J. Yakowenko

Learn More
The present work describes a new algorithm for testing the satissability of statements in propositional logic. It was designed to eeciently handle the most obvious kinds of pathological cases for the Davis-Putnam algorithm. Its performance is compared with a very eecient implementation of Davis-Putnam on a large number of problems, and it is shown to be(More)
  • 1