MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
نویسندگان
چکیده
منابع مشابه
MetiTarski: An Automatic Prover for the Elementary Functions
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 algeb...
متن کاملMetiTarski: Past and Future
A brief overview is presented of MetiTarski [4], an automatic theorem prover for real-valued special functions: ln, exp, sin, cos, etc. MetiTarski operates through a unique interaction between decision procedures and resolution theorem proving. Its history is briefly outlined, along with current projects. A simple collision avoidance example is presented.
متن کاملMetiTarski's Menagerie of Cooperating Systems
MetiTarski, an automatic theorem prover for real-valued special functions, is briefly introduced. Its architecture is sketched, with a focus on the arithmetic reasoning systems that it invokes. Finally, the paper describes some applications where MetiTarski is itself invoked by other tools.
متن کاملMy Life with an Automatic Theorem Prover
Sledgehammer integrates third-party automatic theorem provers in the proof assistant Isabelle/HOL. In the seven years since its first release in 2007, it has grown to become an essential part of most Isabelle users’ workflow. Although a lot of effort has gone into tuning the system, the main reason for Sledgehammer’s success is the impressive power of the external provers, especially E, SPASS, ...
متن کاملSystem Description: ARA - An Automatic Theorem Prover for Relation Algebras
aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow first-order finite variable proofs. Employing results from Tarski/Givant and Maddux we can prove validity in the theories of simple semi-associative relation algebras, relation algebras and representable relation algebras using t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2009
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-009-9149-2