Quantifier elimination by lazy model enumeration - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Quantifier elimination by lazy model enumeration

David Monniaux

Abstract

We propose a quantifier elimination scheme based on nested lazy model enumeration through SMT-solving, and projections. This scheme may be applied to any logic that fulfills certain conditions; we illustrate it for linear real arithmetic. The quantifier elimination problem for linear real arithmetic is doubly exponential in the worst case, and so is our method. We have implemented it and benchmarked it against other methods from the literature.
Fichier principal
Vignette du fichier
nested_quantifiers_article.pdf (204.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00472831 , version 1 (13-04-2010)
hal-00472831 , version 2 (14-04-2010)

Identifiers

  • HAL Id : hal-00472831 , version 2

Cite

David Monniaux. Quantifier elimination by lazy model enumeration. CAV 2010, Jul 2010, Edimburgh, United Kingdom. pp.585-599. ⟨hal-00472831v2⟩
988 View
959 Download

Share

Gmail Facebook X LinkedIn More