Skip to main content
Conference Proceedings

Verifying and reflecting quantifier elimination for presburger arithmetic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3835 LNAI 367-380
DOI: 10.1007/11591191_26
15Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Chaieb, A., & Nipkow, T. (2005). Verifying and reflecting quantifier elimination for presburger arithmetic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3835 LNAI, pp. 367–380). https://doi.org/10.1007/11591191_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free