Abstract
I describe the implementation of two complete decision procedures for integer Presburger arithmetic in the HOL theorem-proving system. The first procedure is Cooper's algorithm, the second, the Omega Test. Between them, the algorithms illustrate three different implementation techniques in a fully expansive system. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Norrish, M. (2003). Complete integer decision procedures as derived rules in HOL. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2758, 71–86. https://doi.org/10.1007/10930755_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free