MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions

被引:62
作者
Akbarpour, Behzad [1 ]
Paulson, Lawrence Charles [1 ]
机构
[1] Univ Cambridge, Comp Lab, Cambridge CB2 3QG, England
基金
英国工程与自然科学研究理事会;
关键词
ELEMENTARY; EFFICIENT;
D O I
10.1007/s10817-009-9149-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for the theory of real closed fields. Special functions are approximated by upper and lower bounds, which are typically rational functions derived from Taylor or continued fraction expansions. The decision procedure simplifies clauses by deleting literals that are inconsistent with other algebraic facts. MetiTarski simplifies arithmetic expressions by conversion to a recursive representation, followed by flattening of nested quotients. Applications include verifying hybrid and control systems.
引用
收藏
页码:175 / 205
页数:31
相关论文
共 43 条
  • [1] Abramowitz M., 1972, Handbook on Mathematical Functions with Formulas, Graphs, and Mathematical Tables
  • [2] AKBARPOUR B, 2006, PDPAR PRAGMATICS DEC, P27
  • [3] Akbarpour B, 2008, LECT NOTES ARTIF INT, V5144, P217, DOI 10.1007/978-3-540-85110-3_18
  • [4] Extending a resolution prover for inequalities on elementary functions
    Akbarpour, Behzad
    Paulson, Lawrence C.
    [J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2007, 4790 : 47 - 61
  • [5] Akbarpour B, 2009, LECT NOTES COMPUT SC, V5469, P1, DOI 10.1007/978-3-642-00602-9_1
  • [6] [Anonymous], THESIS U ST ANDREWS
  • [7] [Anonymous], 1998, DICT INEQUALITIES
  • [8] [Anonymous], PROBLEMS MATH ANAL
  • [9] Baader F., 1998, Term rewriting and all that
  • [10] Bachmair L., Handbook of Automated Reasoning, V31, P19, DOI [10.1016/b978-044450813-3/50004-7, DOI 10.1016/B978-044450813-3/50004-7]