Download PDFOpen PDF in browser

Improving SAT Solver Performance with Structure-based Preferential Bumping

13 pagesPublished: 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:
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\textbackslash{}"uller and Christine Lisetti and Martin Theobald},
  series    = {EPiC Series in Computing},
  volume    = {50},
  pages     = {175--187},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/Smgv},
  doi       = {10.29007/3pxg}}
Download PDFOpen PDF in browser