Anatomy of Alternating Quantifier Satisfiability (Work in progress)

11 pages•Published: August 19, 2013

Anh-Dung Phan, Nikolaj Bjørner and David Monniaux

Abstract

We report on work in progress to generalize an algorithm recently introduced in [10] for checking
satisfiability of formulas with quantifier alternation. The algorithm uses two auxiliary procedures:
a procedure for producing a candidate formula for quantifier elimination and a procedure for eliminating
or partially eliminating quantifiers. We also apply the algorithm for Presburger Arithmetic
formulas and evaluate it on formulas from a model checker for Duration Calculus [8]. We report on
experiments on different variants of the auxiliary procedures. So far, there is an edge to applying
SMT-TEST proposed in [10], while we found that a simpler approach which just eliminates quantified
variables per round is almost as good. Both approaches offer drastic improvements to applying
default quantifier elimination.

Keyphrases: arithmetic, decision procedure, presburger arithmetic, quantifier elimination, smt

In: Pascal Fontaine and Amit Goel (editors). SMT 2012. 10th International Workshop on Satisfiability Modulo Theories, vol 20, pages 120-130.

Links:	https://easychair.org/publications/paper/72M
	https://doi.org/10.29007/8cf7

BibTeX entry

@inproceedings{SMT2012:Anatomy_Alternating_Quantifier_Satisfiability,
  author    = {Anh-Dung Phan and Nikolaj Bjørner and David Monniaux},
  title     = {Anatomy of Alternating Quantifier Satisfiability (Work in progress)},
  booktitle = {SMT 2012. 10th International Workshop on Satisfiability Modulo Theories},
  editor    = {Pascal Fontaine and Amit Goel},
  series    = {EPiC Series in Computing},
  volume    = {20},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/72M},
  doi       = {10.29007/8cf7},
  pages     = {120-130},
  year      = {2013}}

Download PDF Open PDF in browser