Download PDFOpen PDF in browser

Conflicts, Models and Heuristics for Quantifier Instantiation in SMT

15 pagesPublished: March 1, 2017

Abstract

Satisfiability Modulo Theories (SMT) solvers have emerged as prominent tools in formal methods applications. While originally targeted towards quantifier-free inputs, SMT solvers are now often used for handling quantified formulas in automated theorem proving and software verification applications. The most common technique for handling quantified formulas in modern SMT solvers in quantifier instantiation. This paper gives an overview of recent advances in quantifier instantiation in SMT. In addition to the well-known technique known as E-matching, we discuss the use of conflicts and models for accelerating the search for (un)satisfiably. We further mention new instantiation-based techniques that are specialized to background theories such as linear real and integer arithmetic, and future work in this direction.

In: Laura Kovács and Andrei Voronkov (editors). Vampire 2016. Proceedings of the 3rd Vampire Workshop, vol 44, pages 1--15

Links:
BibTeX entry
@inproceedings{Vampire2016:Conflicts_Models_and_Heuristics,
  author    = {Andrew Reynolds},
  title     = {Conflicts, Models and Heuristics for Quantifier Instantiation in SMT},
  booktitle = {Vampire 2016. Proceedings of the 3rd Vampire Workshop},
  editor    = {Laura Kovacs and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {44},
  pages     = {1--15},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/8CX},
  doi       = {10.29007/jmd3}}
Download PDFOpen PDF in browser