Extending a Resolution Prover for Inequalities on Elementary Functions

Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedure for the theory of real closed fields (RCF). The method should be applicable to any functions for which polynomial upper and lower bounds are known. Most bounds only hold for specific argument ranges, but resolution can automatically perform the necessary case analyses. The system consists of a superposition prover (Metis) combined with John Harrison’s RCF solver and a small amount of code to simplify literals with respect to the RCF theory.

• Type: Conference
• Year: 2007
• Where: LPAR
• Authors: Behzad Akbarpour, Lawrence C. Paulson
• Keywords: Artificial Intelligence, Harrison’s RCF Solver, Inequalities Involving Exponentials, LPAR 2007, Resolution Theorem Prover