Verifying and reflecting quantifier elimination for Presburger arithmetic (2005)
by
Amine Chaieb
,
Tobias Nipkow
| Venue: | LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING |
| Citations: | 10 - 6 self |
BibTeX
@INPROCEEDINGS{Chaieb05verifyingand,
author = {Amine Chaieb and Tobias Nipkow},
title = {Verifying and reflecting quantifier elimination for Presburger arithmetic},
booktitle = {LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING},
year = {2005},
pages = {367--380},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present an implementation and verification in higher-order logic of Cooper’s quantifier elimination for Presburger arithmetic. Reflection, i.e. the direct execution in ML, yields a speed-up of a factor of 200 over an LCF-style implementation and performs as well as a decision procedure hand-coded in ML.
