Learn More
In this paper, a new heuristic that can be grafted to many of the most eecient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a higher weight to clauses that have been shown unsatissable at some previous steps of the search process. It is shown eecient for many classes of SAT instances, in particular(More)
In this paper, the use of stochastic search to validate first-order knowledge-based systems is investigated. It is well-known that such techniques can prove efficient in showing that consistency constraints do hold, at least in the proposi-tional case. Powerful heuristics about the trace of stochas-tic search allow proofs of inconsistency to be obtained as(More)
  • 1