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.
Type de document :
Communication dans un congrès
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
Contributeur : David Monniaux <>
Soumis le : mercredi 14 avril 2010 - 19:40:38
Dernière modification le : mercredi 26 mai 2010 - 18:05:01
Document(s) archivé(s) le : jeudi 23 septembre 2010 - 12:54:59

Fichiers

nested_quantifiers_article.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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>

Exporter

Partager

Métriques

Consultations de
la notice

630

Téléchargements du document

230