Real Algebraic Strategies for MetiTarski Proofs
MetiTarski  is an automatic theorem prover that can prove inequalities involving sin, cos, exp, ln, etc. During its proof search, it generates a series of subproblems in nonlinear polynomial real arithmetic which are reduced to true or false using a decision procedure for the theory of real closed fields (RCF). These calls are often a bottleneck: RCF is fundamentally infeasible. However, by studying these subproblems, we can design specialised variants of RCF decision procedures that run faster and improve MetiTarski’s performance.
KeywordsProcessor Time Decision Procedure Model History Automatic Theorem Prover Polynomial Inequality
Unable to display preview. Download preview PDF.
- 7.Jovanovic̀, D., de Moura, L.: Solving Nonlinear Arithmetic. In: IJCAR 2012 (2012)Google Scholar