SGGS Theorem Proving: an Exposition

14 pages•Published: July 5, 2015

Abstract

We present in expository style the main ideas in SGGS, which stands for Semantically-Guided Goal-Sensitive theorem proving. SGGS uses sequences of constrained clauses to represent models, instance generation to go from a candidate model to the next, and resolution as well as other inferences to repair the model. SGGS is refutationally complete for first-order logic, DPLL-style model based, semantically guided, goal sensitive, and proof confluent, which appears to be a rare combination of features. In this paper we describe the core of SGGS in a narrative style, emphasizing ideas and trying to keep technicalities to a minimum, in order to advertise it to builders and users of theorem provers.

Keyphrases: instance based theorem proving, model based theorem proving, semantic guidance

In: Stephan Schulz, Leonardo De Moura and Boris Konev (editors). PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning, vol 31, pages 25-38.

Links:	https://easychair.org/publications/paper/Jdhn
	https://doi.org/10.29007/m2vf

BibTeX entry

@inproceedings{PAAR-2014:SGGS_Theorem_Proving_Exposition,
  author    = {Maria Paola Bonacina and David Plaisted},
  title     = {SGGS Theorem Proving: an Exposition},
  booktitle = {PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Stephan Schulz and Leonardo De Moura and Boris Konev},
  series    = {EPiC Series in Computing},
  volume    = {31},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Jdhn},
  doi       = {10.29007/m2vf},
  pages     = {25-38},
  year      = {2015}}

Download PDF Open PDF in browser