Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Satisfying versus Falsifying in Local Search for Satisfiability

(Poster Presentation)

  • Conference paper
Theory and Applications of Satisfiability Testing – SAT 2012 (SAT 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7317))

Abstract

During local search, clauses may frequently be satisfied or falsified. Modern SLS algorithms often exploit the falsifying history of clauses to select a variable to flip, together with variable properties such as score and age. The score of a variable x refers to the decrease in the number of unsatisfied clauses if x is flipped. The age of x refers to the number of steps done since the last time when x was flipped.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Balint, A., Fröhlich, A.: Improving Stochastic Local Search for SAT with a New Probability Distribution. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 10–15. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Hoos, H.: An Adaptive Noise Mechanism for WalkSAT. In: Proceedings of AAAI 2002, pp. 655–660. AAAI Press / The MIT Press (2002)

    Google Scholar 

  3. Li, C.-M., Huang, W.Q.: Diversification and Determinism in Local Search for Satisfiability. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 158–172. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Li, C.-M., Wei, W., Li, Y.: Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability (Poster Presentation). In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 479–480. Springer, Heidelberg (2012)

    Google Scholar 

  5. McAllester, D.A., Selman, B., Kautz, H.: Evidence for invariant in local search. In: Proceedings of AAAI 1997, pp. 321–326 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MIS, Université de Picardie Jules Verne, France

    Chu Min Li & Yu Li

Authors
  1. Chu Min Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Information Technology, Fondazione Bruno Kessler, via Sommarive 18, Povo, 38123, Trento, Italy

    Alessandro Cimatti

  2. Department of Information Engineering and Computer Science, University of Trento, via Sommarive 14, Povo, 38123, Trento, Italy

    Roberto Sebastiani

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, C.M., Li, Y. (2012). Satisfying versus Falsifying in Local Search for Satisfiability. In: Cimatti, A., Sebastiani, R. (eds) Theory and Applications of Satisfiability Testing – SAT 2012. SAT 2012. Lecture Notes in Computer Science, vol 7317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31612-8_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31612-8_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31611-1

  • Online ISBN: 978-3-642-31612-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation