MetiTarski: An Automatic Prover for the Elementary Functions

Authors:
Behzad Akbarpour;Lawrence C. Paulson
Affiliations:
Computer Laboratory, University of Cambridge, England;Computer Laboratory, University of Cambridge, England
Venue:
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Year:
2008

Citing 9
Cited 5

Term rewriting and all that

Term rewriting and all that
Automatic derivation of the irrationality of e

Journal of Symbolic Computation - Calculemus-99: integrating computation and deduction
Otter - The CADE-13 Competition Incarnations

Journal of Automated Reasoning
Formalized Mathematics

Formalized Mathematics
QEPCAD B: a program for computing with semi-algebraic sets using CADs

ACM SIGSAM Bulletin
Verified Real Number Calculations: A Library for Interval Arithmetic

IEEE Transactions on Computers
Extending a resolution prover for inequalities on elementary functions

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
An extension of the Knuth-Bendix ordering with LPO-like properties

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
A proof-producing decision procedure for real arithmetic

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Applications of MetiTarski in the Verification of Control and Hybrid Systems

HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Formal verification of analog circuits in the presence of noise and process variation

Proceedings of the Conference on Design, Automation and Test in Europe
Towards flight control verification using automated theorem proving

NFM'11 Proceedings of the Third international conference on NASA Formal methods
dReal: an SMT solver for nonlinear theories over the reals

CADE'13 Proceedings of the 24th international conference on Automated Deduction
Optimising problem formulation for cylindrical algebraic decomposition

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modified to call a decision procedure (QEPCAD) for the theory of real closed fields. The decision procedure simplifies clauses by deleting literals that are inconsistent with other algebraic facts, while deleting as redundant clauses that follow algebraically from other clauses. MetiTarski includes special code to simplify arithmetic expressions.