International Conference on Principles and Practice of Constraint Programming

CP 2001: Principles and Practice of Constraint Programming — CP 2001 pp 605-609

Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination

  • Hirsch Edward A. 
  • Arist Kojevnikov
Conference paper

DOI: 10.1007/3-540-45578-7_48

Volume 2239 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Hirsch E.A., Kojevnikov A. (2001) Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. In: Walsh T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg

Abstract

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.

Keywords:

Boolean satisfiability local search empirical evaluation 

Preview

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