![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 05 February 2008, 13:00-14:00
Automatic Proof for Theorems On Transcendental Functions
- 👤 Speaker: Lawrence Paulson (University of Cambridge)
- 📅 Date & Time: Tuesday 05 February 2008, 13:00 - 14:00
- 📍 Venue: Computer Laboratory, William Gates Building, Room SS03
Questions? Contact
Thomas Tuerk
Abstract
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.
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- 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
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.