Generic proof synthesis for Presburger arithmetic (2003)
by
Amine Chaieb
,
Tobias Nipkow
| Citations: | 4 - 3 self |
BibTeX
@TECHREPORT{Chaieb03genericproof,
author = {Amine Chaieb and Tobias Nipkow},
title = {Generic proof synthesis for Presburger arithmetic},
institution = {},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We develop in complete detail an extension of Cooper’s decision procedure for Presburger arithmetic that returns a proof of the equivalence of the input formula to a quantifier-free formula. For closed input formulae this is a proof of their validity or unsatisfiability. The algorithm is formulated as a functional program that makes only very minimal assumptions w.r.t. the underlying logical system and is therefore easily adaptable to specific theorem provers.
