Improved Local Search for Circuit Satisfiability

  • Anton Belov
  • Zbigniew Stachniak
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6175)


In this paper we describe a significant improvement to the justificationbased local search algorithm for circuit satisfiability proposed by Järvisalo et al [7]. By carefully combining local search with Boolean Constraint Propagation we achieve multiple orders of magnitude reduction in run-time on industrial and structured benchmark circuits, and, in some cases, performance comparable with complete SAT solvers.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Belov, A., Stachniak, Z.: Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 258–264. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 2.
    Belov, A.: Stochastic Local Search for Non-Clausal and Circuit Satisfiability. In: preparation PhD Thesis, York University, Toronto, Canada (2010)Google Scholar
  3. 3.
    Crawford, J.M., Kearns, M.J., Shapire, R.E.: The Minimal Disagreement Parity Problem as Hard Satisfiability Problem. Tech. report CIRL and ATT Bell Labs (1994)Google Scholar
  4. 4.
    Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Hirsch, E.A., Kojevnikov, A.: UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination. Annals of Mathematics and Artificial Intelligence (2005)Google Scholar
  6. 6.
    Hoos, H.H., Stutzle, T.: Local Search Algorithms for SAT: An Empirical Evaluation. J. of Automated Reasoning (2000)Google Scholar
  7. 7.
    Järvisalo, M., Junttila, T., Niemelä, I.: Justification-Based Non-Clausal Local Search for SAT. In: Proc. of ECAI 2008 (2008)Google Scholar
  8. 8.
    Junttila, T.: The BC Package and a File Format for Constrained Boolean Circuits,
  9. 9.
    Kuehlmann, A., Ganai, M., Paruthi, V.: Circuit-based Boolean Reasoning. In: Proc. of DAC 2001 (2001)Google Scholar
  10. 10.
    Pham, D.N., Thornton, J., Sattar, A.: Building Structure into Local Search for SAT. In: Proc. of IJCAI 2007 (2007)Google Scholar
  11. 11.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Anton Belov
    • 1
  • Zbigniew Stachniak
    • 1
  1. 1.Department of Computer Science and EngineeringYork UniversityTorontoCanada

Personalised recommendations