Robert Brummayer, Duckki Oe , Aaron Stump,
"Exploring Predictability of SAT/SMT Solvers"
: Intl. Workshop on Evaluation Methods for Solvers and Quality Metrics for Solutions (EMSQMS'10), affiliated to IJCAR'10 and CAV'10 at FLOC'10., 2010
Original Titel:
Exploring Predictability of SAT/SMT Solvers
Sprache des Titels:
Englisch
Original Buchtitel:
Intl. Workshop on Evaluation Methods for Solvers and Quality Metrics for Solutions (EMSQMS'10), affiliated to IJCAR'10 and CAV'10 at FLOC'10.
Original Kurzfassung:
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 semanticsmodifying
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.