 |
|
|
|
| HAL : hal-00472831, version 2 |
| Fiche détaillée |  Récupérer au format |
|
|
| CAV 2010, Edimburgh : United Kingdom (2010) |
|
|
| Versions disponibles : | v1 (13-04-2010) | v2 (15-04-2010) |
|
|
|
|
| Quantifier elimination by lazy model enumeration |
|
|
| David Monniaux 1 |
|
|
| (07/2010) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | VERIMAG (VERIMAG - IMAG) |
|
|
|
CNRS : UMR5104 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG) |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Logique en informatique |
|
|
| quantifier elimination – SMT-solving – linear arithmetic |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00472831, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00472831 | |
| oai: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 | |
