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 ([9] and [11,12]). Despite its simplicity, our algorithm performs well on many common benchmarks (we present results of its empirical evaluation). It is also probabilistically approximately complete.
CITATION STYLE
Hirsch, E. A., & Kojevnikov, A. (2001). Solving Boolean satisfiability using local search guided by unit clause elimination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2239, pp. 605–609). Springer Verlag. https://doi.org/10.1007/3-540-45578-7_48
Mendeley helps you to discover research relevant for your work.