Theorem recycling for Theorem Proving

8 pages•Published: June 29, 2018

Abstract

In this paper we examine two cases where solutions to one system of constraints can be used or adapted to solutions to others, for free. We first revisit a method by Bromberger for lifting solutions to systems over linear real arithmetic to solutions over integers. We extend it by identifying several scenarios where solutions over reals can be directly used to establish solutions over integers. Our second case discusses model-based projection, which was introduced in two different places with different, dual, definitions. It turns out that one can typically use the same underlying engines to compute both versions of model based projection and we characterize when this is the case. We extend projection with model- based realization. When used for quantifier reasoning, it serves a complementary purpose than projection. While projection can be used for computing conflict clauses, realizers may be used for forward pruning.

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

Links:	https://easychair.org/publications/paper/qGfG
	https://doi.org/10.29007/r58f

BibTeX entry

@inproceedings{Vampire17:Theorem_recycling_Theorem_Proving,
  author    = {Nikolaj Bjorner and Lev Nachmanson},
  title     = {Theorem recycling for Theorem Proving},
  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/qGfG},
  doi       = {10.29007/r58f},
  pages     = {1-8},
  year      = {2018}}

Download PDF Open PDF in browser