Instantiations, Zippers and EPR Interpolation

7 pages•Published: July 28, 2014

Nikolaj Bjorner, Arie Gurfinkel, Konstantin Korovin and Ori Lahav

Abstract

This paper describes interpolation procedures for EPR.
In principle, interpolation for EPR is simple:
It is a special case of first-order interpolation.
In practice, we would like procedures that take advantage
of properties of EPR: EPR admits finite models and those models
are sometimes possible to describe very compactly.
Inspired by procedures for propositional logic that use
models and cores, but not proofs, we develop a procedure for EPR
that uses just models and cores.

Keyphrases: epr, interpolation, smt, theorem proving

In: Ken Mcmillan, Aart Middeldorp, Geoff Sutcliffe and Andrei Voronkov (editors). LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 26, pages 35-41.

Links:	https://easychair.org/publications/paper/XtN
	https://doi.org/10.29007/xt3j

BibTeX entry

@inproceedings{LPAR-19:Instantiations_Zippers_EPR_Interpolation,
  author    = {Nikolaj Bjorner and Arie Gurfinkel and Konstantin Korovin and Ori Lahav},
  title     = {Instantiations, Zippers and EPR Interpolation},
  booktitle = {LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Ken Mcmillan and Aart Middeldorp and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {26},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/XtN},
  doi       = {10.29007/xt3j},
  pages     = {35-41},
  year      = {2014}}

Download PDF Open PDF in browser