University of Cambridge > > Computer Laboratory Automated Reasoning Group Lunches > Automatic Proof for Theorems On Transcendental Functions

Automatic Proof for Theorems On Transcendental Functions

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Thomas Tuerk.

Speaker: Lawrence Paulson

Many inequalities involving exponentials, logarithms and other functions can be proved automatically by combining a resolution theorem prover (Metis) with a decision procedure for the theory of real closed fields (QEPCAD). The method should be applicable to any functions for which polynomial upper and lower bounds are known. The resolution prover is modified to use the decision procedure to simplify clauses and to detect redundant clauses. The method requires a careful selection of axioms, including bounds on the mathematical functions.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity