Subclasses of Presburger arithmetic and the polynomial-time hierarchy
Theoretical Computer Science
The complexity of linear problems in fields
Journal of Symbolic Computation
The complexity of almost linear diophantine problems
Journal of Symbolic Computation
The Omega test: a fast and practical integer programming algorithm for dependence analysis
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Complexity and uniformity of elimination in Presburger arithmetic
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Mixed real-integer linear quantifier elimination
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Journal of the ACM (JACM)
A compiled implementation of strong reduction
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Autarkic Computations in Formal Proofs
Journal of Automated Reasoning
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Elementary bounds for presburger arithmetic
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Presburger arithmetic with bounded quantifier alternation
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the Automata Size for Presburger Arithmetic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Precise bounds for presburger arithmetic and the reals with addition: Preliminary report
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Verifying and reflecting quantifier elimination for presburger arithmetic
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
An interpretation of Isabelle/HOL in HOL light
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Importing HOL into Isabelle/HOL
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Verifying mixed real-integer quantifier elimination
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A proof-producing decision procedure for real arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Formalizing the Logic-Automaton Connection
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Verifying safety properties with the TLA+ proof system
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Scalable LCF-Style proof translation
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Cooper (for Z) and by Ferrante and Rackoff (for 驴). Both algorithms are realized in two entirely different ways: once in tactic style, i.e. by a proof-producing functional program, and once by reflection, i.e. by computations inside the logic rather than in the meta-language. Both formalizations are generic because they make only minimal assumptions w.r.t. the underlying logical system and theorem prover. An implementation in Isabelle/HOL shows that the reflective approach is between one and two orders of magnitude faster.