MetiTarski: An automatic prover for the elementary functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5144 LNAI, Issue , 2008, Pages 217-231

  Akbarpour, Behzad ^a   Paulson, Lawrence C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; ARTIFICIAL INTELLIGENCE; COMPUTER NETWORKS; INFORMATION MANAGEMENT; KNOWLEDGE MANAGEMENT; MANAGEMENT INFORMATION SYSTEMS; THEOREM PROVING;

DECISION PROCEDURES; INTERNATIONAL CONFERENCES; SYMBOLIC COM-PUTATION;

DECISION THEORY;

EID: 51049120103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85110-3_18     Document Type: Conference Paper

References (19)

1. Akbarpour, B., Paulson. L.: Extending a resolution prover for inequalities on elementary functions. In: Logic for Programming, Artificial Intelligence, and Reasoning, pp. 47-61 (2007)
2. Akbarpour, B., Paulson, L.C.: Towards automatic proofs of inequalities involving elementary functions. In: Cook, B., Sebastiani, R. (eds.) PDPAR: Pragmatics of Decision Procedures in Automated Reasoning, pp. 27-37 (2006)
3. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press. Cambridge (1998)
4. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 2, vol. 1, pp. 19-99, Elsevier Science, Amsterdam (2001)
5. Beeson, M.: Automatic generation of a proof of the irrationality of e. JSC 32(4), 333-349 (2001)
6. Brown, C.W.: QEPCAD B: a program for computing with semi-algebraic sets using CADs. SIGSAM Bulletin 37(4), 97-108 (2003)
7. Bullen, P.S.: A Dictionary of Inequalities, Longman (1998)
8. Clarke, E., Zhao, X.: Analytical A theorem prover for Mathematica. Mathematica Journal 3(1), 56-71 (1993)
9. Daumas, M., Muñoz, C., Lester, D.: Verified real number calculations: A library for integer arithmetic, http://hal.archives-ouvertes.fr/ hal-00168402/fr/
10. Dolzmann, A., Sturm, T., Weispfenning, V.: Real quantifier elimination in practice. Technical Report MIP-9720, Universität Passau, D-94030, Germany (1997)
11. Harrison, J.: Formalized mathematics. Technical Report 36. Turku Centre for Computer Science (TUCS), Lemminkäisenkatu 14 A. FIN-20520 Turku, Finland (1996), http://www.cl.cam.ac.uk/jrh13/papers/form-math3.html
12. Hong, H.: QEPCAD -quantifier elimination by partial cylindrical algebraic decomposition. Sources and documentation are on the Internet,
13. http://www.cs.usna.edu/qepcad/B/QEPCAD.html
14. Hörmander, L.: The Analysis of Linear Partial Differential Operators II: Differential Operators with Constant Coefficient. Springer, Heidelberg (2006) (First published in 1983): cited by Mclaughlin and Harrison [17]
15. Hurd, J.: Metis first order prover (2007), http://gilith.com/software/ metis/
16. Ludwig, M., Waldmann, U.: An extension of the Knuth-Bendix ordering with LPO-like properties. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 348-362. Springer. Heidelberg (2007)
17. McCune, W., Wos, L.: Otter: The CADE-13 competition incarnations. Journal of Automated Reasoning 18(2), 211-220 (1997)
18. McLaughlin, S., Harrison, J.: A proof-producing decision procedure for real arithmetic. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 295-314. Springer. Heidelberg (2005)
19. Prevosto, V., Waldmann. U.: SPASS+T. In: Sutcliffe, G., Schmidt, R., Schulz, S. (eds.) FLoC 2006 Workshop on Empirically Successful Computerized Reasoning. CEUR Workshop Proceedings, vol. 192, pp. 18-33 (2006)