Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers

@inproceedings{Liang2015UnderstandingVB,
  title={Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers},
  author={Jia Hui Liang and Vijay Ganesh and Edward Zulkoski and Atulan Zaman and Krzysztof Czarnecki},
  booktitle={Haifa Verification Conference},
  year={2015}
}
Conflict-Driven Clause-Learning (CDCL) SAT solvers crucially depend on the Variable State Independent Decaying Sum (VSIDS) branching heuristic for their performance. Although VSIDS was proposed nearly fifteen years ago, and many other branching heuristics for SAT solving have since been proposed, VSIDS remains one of the most effective branching heuristics. Despite its widespread use and repeated attempts to understand it, this additive bumping and multiplicative decay branching heuristic has… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 42 references

Exponential Smoothing for predicting demand

  • R. G. Brown
  • 1956
Highly Influential
14 Excerpts

Mahajan , Zhaohui Fu , and Sharad Malik . Zchaff 2004 : An efficient sat solver

  • João P Marques-Silva
  • Trading systems and methods
  • 2013

Trading systems and methods

  • P. J. Kaufman
  • 2013
2 Excerpts

Similar Papers

Loading similar papers…