A Model Guided Instantiation Heuristic for the Superposition Calculus with Theories

13 pages•Published: July 5, 2015

Abstract

Generalised Model Finding (GMF) is a quantifier instantiation heuristic for the superposition calculus in the presence of interpreted theories with arbitrarily quantified free function symbols ranging into theory sorts.
The free function symbols are approximated by finite partial function graphs along with some simplifying assumptions which are iteratively refined.
Here we present an outline of the GMF approach, give an improvement
that addresses some of these and then present some
ideas for extending it with concepts from instantiation based theorem proving.

Keyphrases: model finding, quantifier instantiation, superposition calculus

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

Links:	https://easychair.org/publications/paper/ldr
	https://doi.org/10.29007/b923

BibTeX entry

@inproceedings{PAAR-2014:Model_Guided_Instantiation_Heuristic,
  author    = {Joshua Bax},
  title     = {A Model Guided Instantiation Heuristic for the Superposition Calculus with Theories},
  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/ldr},
  doi       = {10.29007/b923},
  pages     = {12-24},
  year      = {2015}}

Download PDF Open PDF in browser