Automatic Proof for Theorems On Transcendental Functions

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

• Lawrence Paulson (University of Cambridge)
• Tuesday 05 February 2008, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

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.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Automated Reasoning Group Lunches
• Computer Laboratory, William Gates Building, Room SS03
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.