Judith Furman

Learn More
We describe a two phase algorithm for MAX{SAT and weighted MAX{ SAT problems. In the rst phase, we use the GSAT heuristic to nd a good solution to the problem. In the second phase, we use an enumera-tion procedure based on the Davis{Putnam{Loveland algorithm, to nd a provably optimal solution. The rst heuristic stage improves the performance of the(More)
  • 1