Skip to main content

Exploiting Historical Relationships of Clauses and Variables 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

Variable properties such as score and age are used to select a variable to flip. 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. If the best variable according to scores in a randomly chosen unsatisfied clause c is not the youngest in c, Novelty [4] flips this variable. Otherwise, with probability p (noise p), Novelty flips the second best variable, and with probability 1-p, Novelty flips the best variable. Novelty+ [1] randomly flips a variable in c with probability wp and does as Novelty with probability 1-wp. Novelty++ [3] flips the least recently flipped variable (oldest) in c with probability dp, and does as Novelty with probability 1-dp.

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

Access this chapter

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. Hoos, H.: On the run-time behavior of stochastic local search algorithms for SAT. In: Proceedings of AAAI 1999, pp. 661–666 (1999)

    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. McAllester, D.A., Selman, B., Kautz, H.: Evidence for invariant in local search. In: Proceedings of AAAI 1997, pp. 321–326 (1997)

    Google Scholar 

  5. Roussel, O.: Description of ppfolio (2011), http://www.cril.univ-artois.fr/SAT11/phase2.pdf

  6. Wei, W., Li, C.-M., Zhang, H.: Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 313–326. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, C.M., Wei, W., Li, Y. (2012). Exploiting Historical Relationships of Clauses and Variables 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_44

Download citation

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

  • 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