The complexity of linear problems in fields
Journal of Symbolic Computation
Constructive type classes in Isabelle
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Interpretation of locales in isabelle: theories and proof contexts
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Verifying and reflecting quantifier elimination for presburger arithmetic
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Verifying mixed real-integer quantifier elimination
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving bounds for real linear programs in Isabelle/HOL
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
A proof-producing decision procedure for real arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
A Quantifier Elimination Algorithm for Linear Real Arithmetic
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Formalizing the Logic-Automaton Connection
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Journal of Automated Reasoning
A formal quantifier elimination for algebraically closed fields
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
Linear quantifier elimination as an abstract decision procedure
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
| Hi-index | 0.04 |
This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All procedures are defined and verified in the theorem prover Isabelle/HOL, are executable and can be applied to HOL formulae themselves (by reflection).