Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers
Jia Hui Liang, Vijay Ganesh, Ed Zulkoski, Atulan Zaman, Krzysztof, Czarnecki

TL;DR
This paper provides a detailed analysis of the VSIDS branching heuristic in SAT solvers, revealing its preference for high-centrality bridge variables and the role of decay, leading to an improved adaptive heuristic.
Contribution
It uncovers the structural properties of variables selected by VSIDS and introduces a new adaptive heuristic that outperforms existing variants.
Findings
VSIDS predominantly selects bridge variables connecting communities.
Multiplicative decay acts like an exponential moving average favoring persistent variables.
The new adaptive heuristic solves more instances than previous variants.
Abstract
Conflict-Driven Clause-Learning 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. In this paper, we advance our understanding of VSIDS by answering the following key questions. The first question we pose is "what is special about the class of variables that VSIDS chooses to additively bump?" In answering this question we showed that VSIDS overwhelmingly picks, bumps, and learns bridge variables, defined as the variables that connect distinct communities in the community structure of SAT instances. This is surprising since VSIDS was invented more than a decade before the link between community structure and SAT solver…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Game Theory and Applications · Auction Theory and Applications
