The Uses of SAT Solvers in Vampire

7 pages•Published: February 23, 2016

Abstract

Reasoning in a saturation-based first-order theorem prover is generally expensive involving complex term-indexing data structures and inferences such as subsumption resolution whose (worst case) running time is exponential in the length of the clause. In contrast, SAT solvers are very cheap, being able to solve large problems quickly and with relatively little memory overhead.
Consequently, utilising this cheap power within Vampire to carry out certain tasks has proven highly successful. We give an overview of the different ways that SAT solvers are utilised
within Vampire and discuss further ways in which this usage could be extended

Keyphrases: avatar, theorem proving, vampire

In: Laura Kovács and Andrei Voronkov (editors). Proceedings of the 1st and 2nd Vampire Workshops, vol 38, pages 63-69.

Links:	https://easychair.org/publications/paper/ZG9
	https://doi.org/10.29007/4w68

BibTeX entry

@inproceedings{Vampire2014and2015:Uses_SAT_Solvers_Vampire,
  author    = {Giles Reger and Martin Suda},
  title     = {The Uses of SAT Solvers in Vampire},
  booktitle = {Proceedings of the 1st and 2nd Vampire Workshops},
  editor    = {Laura Kovács and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {38},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/ZG9},
  doi       = {10.29007/4w68},
  pages     = {63-69},
  year      = {2016}}

Download PDF Open PDF in browser