Published in

Springer, Lecture Notes in Computer Science, p. 217-231, 2008

DOI: 10.1007/978-3-540-85110-3_18

Links

Tools

Export citation

Search in Google Scholar

MetiTarski: An Automatic Prover for the Elementary Functions

Proceedings article published in 2008 by Behzad Akbarpour, Lawrence C. Paulson
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modied to call a decision procedure (QEPCAD) for the theory of real closed elds. The decision procedure simplies 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.