Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination
In this paper we present a new randomized algorithm for SAT combining unit clause elimination and local search. The algorithm is inspired by two randomized algorithms having the best current worst- case upper bounds (and ,). Despite its simplicity, our algorithm performs well on many common benchmarks (we present results of its empirical evaluation). It is also probabilistically approximately complete.
Keywords:Boolean satisfiability local search empirical evaluation
Unable to display preview. Download preview PDF.