Combining Inference and Search for the Propositional Satisfiability Problem

The most effective complete method for testing propositional satisfiability (SAT) is backtracking search. Recent research suggests that adding more inference to SAT search procedures can improve their performance. This paper presents two ways to combine neighbour resolution (one such inference technique) with search.

Authors

• Lyndon Drake and Alan Frisch University of York; Toby Walsh

Keywords

No keywords are indexed for this paper.