Playing with Quantified Satisfaction

13 pages•Published: December 18, 2015

Abstract

We develop an algorithm for satisfiability of quantified formulas.
The algorithm is based on recent progress in solving Quantified Boolean Formulas,
but it generalizes beyond propositional logic to theories, such as linear arithmetic
over integers (Presburger arithmetic), linear arithmetic over reals, algebraic data-types and arrays.
Compared with previous algorithms for satisfiability of quantified arithmetical formulas
our new implementation outperforms previous implementations in Z3 by a significant margin.

Keyphrases: qbf, quantifier elimination, smt

In: Ansgar Fehnker, Annabelle McIver, Geoff Sutcliffe and Andrei Voronkov (editors). LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations, vol 35, pages 15-27.

Links:	https://easychair.org/publications/paper/jmM
	https://doi.org/10.29007/vv21

BibTeX entry

@inproceedings{LPAR-20:Playing_with_Quantified_Satisfaction,
  author    = {Nikolaj Bjorner and Mikolas Janota},
  title     = {Playing with Quantified Satisfaction},
  booktitle = {LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations},
  editor    = {Ansgar Fehnker and Annabelle McIver and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {35},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/jmM},
  doi       = {10.29007/vv21},
  pages     = {15-27},
  year      = {2015}}

Download PDF Open PDF in browser