Light-Weight Integration of SAT Solving into First-Order Reasoners – First Experiments

11 pages•Published: June 29, 2018

Abstract

We describe a light-weight integration of the propositional SAT solver PicoSAT and the saturation-based superposition prover E. The proof search is driven by the saturation prover. Periodically, the saturation is interrupted, and all first-order clauses are grounded. The resulting ground problem is converted to a propositional format and handed to the SAT solver. If the SAT solver reports unsatisfiability, the proof is extracted and reported on the first-order level. First experiments demonstrate the viability of the approach and suggest future extensions. They also yield interesting information about the structure of the search space.

In: Laura Kovács and Andrei Voronkov (editors). Vampire 2017. Proceedings of the 4th Vampire Workshop, vol 53, pages 9-19.

Links:	https://easychair.org/publications/paper/94vW
	https://doi.org/10.29007/89kc

BibTeX entry

@inproceedings{Vampire17:Light_Weight_Integration_SAT,
  author    = {Stephan Schulz},
  title     = {Light-Weight Integration of SAT Solving into First-Order Reasoners – First Experiments},
  booktitle = {Vampire 2017. Proceedings of the 4th Vampire Workshop},
  editor    = {Laura Kovács and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {53},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/94vW},
  doi       = {10.29007/89kc},
  pages     = {9-19},
  year      = {2018}}

Download PDF Open PDF in browser