Exploring Predictability of SAT/SMT Solvers

14 pages•Published: May 15, 2012

Robert Brummayer, Duckki Oe and Aaron Stump

Abstract

This paper seeks to explore the predictability of SAT and SMT solvers in response to different kinds of changes to benchmarks. We consider both semantics-preserving and possibly semantics-modifying transformations, and provide preliminary data about solver predictability. We also propose carrying learned theory lemmas over from an original run to runs on similar benchmarks, and show the benefits of this idea as a heuristic for improving predictability of SMT solvers.

Keyphrases: performance metrics, predictability, sat, smt

In: Aaron Stump, Geoff Sutcliffe and Cesare Tinelli (editors). EMSQMS 2010. Workshop on Evaluation Methods for Solvers, and Quality Metrics for Solutions, vol 6, pages 5-18.

Links:	https://easychair.org/publications/paper/qFpx
	https://doi.org/10.29007/h5vg

BibTeX entry

@inproceedings{EMSQMS2010:Exploring_Predictability_SAT/SMT_Solvers,
  author    = {Robert Brummayer and Duckki Oe and Aaron Stump},
  title     = {Exploring Predictability of SAT/SMT Solvers},
  booktitle = {EMSQMS 2010. Workshop on Evaluation Methods for Solvers, and Quality Metrics for Solutions},
  editor    = {Aaron Stump and Geoff Sutcliffe and Cesare Tinelli},
  series    = {EPiC Series in Computing},
  volume    = {6},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/qFpx},
  doi       = {10.29007/h5vg},
  pages     = {5-18},
  year      = {2012}}

Download PDF Open PDF in browser