Improving SAT Solver Performance with Structure-based Preferential Bumping

13 pages•Published: October 19, 2017

Abstract

We present a method we call structure-based preferential bumping,
as a low-cost way to exploit formula structure in VSIDS-based SAT solvers.
We show that the Glucose SAT solver, when modified with preferential bumping
of certain easily identified structurally important variables,
out-performs unmodified Glucose on the industrial formulas
from recent SAT solver competitions.

Keyphrases: bridge variables, cdcl, centrality, community structure, industrial formulas, vsids

In: Christoph Benzmüller, Christine Lisetti and Martin Theobald (editors). GCAI 2017. 3rd Global Conference on Artificial Intelligence, vol 50, pages 175-187.

Links:	https://easychair.org/publications/paper/Smgv
	https://doi.org/10.29007/3pxg

BibTeX entry

@inproceedings{GCAI2017:Improving_SAT_Solver_Performance,
  author    = {Sima Jamali and David Mitchell},
  title     = {Improving SAT Solver Performance with Structure-based Preferential Bumping},
  booktitle = {GCAI 2017. 3rd Global Conference on Artificial Intelligence},
  editor    = {Christoph Benzmüller and Christine Lisetti and Martin Theobald},
  series    = {EPiC Series in Computing},
  volume    = {50},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Smgv},
  doi       = {10.29007/3pxg},
  pages     = {175-187},
  year      = {2017}}

Download PDF Open PDF in browser