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
Byron Cook, Paul Jackson, Tayssir Touili. CAV 2010, Jul 2010, Edimburgh, United Kingdom. Springer-Verlag, 6174, pp.585-599, 2010, Lecture notes in computer science


https://hal.archives-ouvertes.fr/hal-00472831
Contributor : David Monniaux <>
Submitted on : Wednesday, April 14, 2010 - 7:40:38 PM
Last modification on : Wednesday, May 26, 2010 - 6:05:01 PM

Files

nested_quantifiers_article.pdf
fileSource_public_author

Identifiers

  • HAL Id : hal-00472831, version 2

Collections

Citation

David Monniaux. Quantifier elimination by lazy model enumeration. Byron Cook, Paul Jackson, Tayssir Touili. CAV 2010, Jul 2010, Edimburgh, United Kingdom. Springer-Verlag, 6174, pp.585-599, 2010, Lecture notes in computer science. <hal-00472831v2>

Export

Share

Metrics

Consultation de
la notice

349

Téléchargement du document

134