Quantifier elimination by lazy model enumeration - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Quantifier elimination by lazy model enumeration

David Monniaux

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-00472831 , version 2

Citer

David Monniaux. Quantifier elimination by lazy model enumeration. CAV 2010, Jul 2010, Edimburgh, United Kingdom. pp.585-599. ⟨hal-00472831v2⟩
995 Consultations
964 Téléchargements

Partager

Gmail Facebook X LinkedIn More