Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Quantifier elimination by lazy model enumeration

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00472831
Contributor : David Monniaux Connect in order to contact the contributor
Submitted on : Wednesday, April 14, 2010 - 7:40:38 PM
Last modification on : Tuesday, October 19, 2021 - 1:48:09 PM
Long-term archiving on: : Thursday, September 23, 2010 - 12:54:59 PM

Files

nested_quantifiers_article.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00472831, version 2

Collections

UGA | IMAG | CNRS | VERIMAG | ANR

Citation

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

Share

Metrics

Record views

878

Files downloads

747