MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions

Authors:
Behzad Akbarpour;Lawrence Charles Paulson
Affiliations:
Computer Laboratory, University of Cambridge, Cambridge, UK;Computer Laboratory, University of Cambridge, Cambridge, UK
Venue:
Journal of Automated Reasoning
Year:
2010

Citing 18
Cited 15

Term rewriting and all that

Term rewriting and all that
Symbolic Reachability Computation for Families of Linear Vector Fields

Journal of Symbolic Computation
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
QEPCAD B: a program for computing with semi-algebraic sets using CADs

ACM SIGSAM Bulletin
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Efficient solving of quantified inequality constraints over the real numbers

ACM Transactions on Computational Logic (TOCL)
Elementary Functions: Algorithms and Implementation

Elementary Functions: Algorithms and Implementation
Safety verification of hybrid systems by constraint propagation-based abstraction refinement

ACM Transactions on Embedded Computing Systems (TECS)
The rational numbers as an abstract data type

Journal of the ACM (JACM)
Efficient and Reliable Multiprecision Implementation of Elementary and Special Functions

SIAM Journal on Scientific Computing
Handbook of Continued Fractions for Special Functions

Handbook of Continued Fractions for Special Functions
Verified Real Number Calculations: A Library for Interval Arithmetic

IEEE Transactions on Computers
Handbook of Practical Logic and Automated Reasoning

Handbook of Practical Logic and Automated Reasoning
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
Proving equalities in a commutative ring done right in coq

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

Formalizing and operationalizing industrial standards

FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Automatic verification of estimate functions with polynomials of bounded functions

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
On transfinite Knuth-Bendix orders

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Validating QBF validity in HOL4

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Proving valid quantified Boolean formulas in HOL light

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Trustworthy numerical computation in Scala

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
The TPTP typed first-order form with arithmetic

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Real algebraic strategies for metitarski proofs

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
δ-complete decision procedures for satisfiability over the reals

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Solving non-linear arithmetic

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Case Splitting in an Automatic Theorem Prover for Real-Valued Special Functions

Journal of Automated Reasoning
Formalization of Bernstein Polynomials and Applications to Global Optimization

Journal of Automated Reasoning
Optimising problem formulation for cylindrical algebraic decomposition

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Certification of bounds of non-linear functions: the templates method

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Automated reasoning service for HOL light

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work explores some aspects of a new and natural semantical dimension that can be accommodated within the syntax of description logics which opens up when passing from the classical truth-value interpretation to a constructive interpretation. ...