Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination

  • Hirsch Edward A. 
  • Arist Kojevnikov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)


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.


Boolean satisfiability local search empirical evaluation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Hirsch Edward A. 
    • 1
  • Arist Kojevnikov
    • 2
  1. 1.Steklov Institute of Mathematics at St.PetersburgSt.PetersburgRussia
  2. 2.Department of Mathematics and MechanicsSt.Petersburg State UniversitySt.PetersburgRussia

Personalised recommendations