{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:57:59Z","timestamp":1725890279835},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851097"},{"type":"electronic","value":"9783540851103"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85110-3_18","type":"book-chapter","created":{"date-parts":[[2008,7,26]],"date-time":"2008-07-26T06:00:32Z","timestamp":1217052032000},"page":"217-231","source":"Crossref","is-referenced-by-count":14,"title":["MetiTarski: An Automatic Prover for the Elementary Functions"],"prefix":"10.1007","author":[{"given":"Behzad","family":"Akbarpour","sequence":"first","affiliation":[]},{"given":"Lawrence C.","family":"Paulson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Akbarpour, B., Paulson, L.: Extending a resolution prover for inequalities on elementary functions. In: Logic for Programming, Artificial Intelligence, and Reasoning, pp. 47\u201361 (2007)","DOI":"10.1007\/978-3-540-75560-9_6"},{"key":"18_CR2","unstructured":"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\u201337 (2006)"},{"key":"18_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/B978-044450813-3\/50004-7","volume-title":"Handbook of Automated Reasoning, ch. 2","author":"L. Bachmair","year":"2001","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 2, vol.\u00a0I, pp. 19\u201399. Elsevier Science, Amsterdam (2001)"},{"issue":"4","key":"18_CR5","first-page":"333","volume":"32","author":"M. Beeson","year":"2001","unstructured":"Beeson, M.: Automatic generation of a proof of the irrationality of e. JSC\u00a032(4), 333\u2013349 (2001)","journal-title":"JSC"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/968708.968710","volume":"37","author":"C.W. Brown","year":"2003","unstructured":"Brown, C.W.: QEPCAD B: a program for computing with semi-algebraic sets using CADs. SIGSAM Bulletin\u00a037(4), 97\u2013108 (2003)","journal-title":"SIGSAM Bulletin"},{"key":"18_CR7","unstructured":"Bullen, P.S.: A Dictionary of Inequalities, Longman (1998)"},{"issue":"1","key":"18_CR8","first-page":"56","volume":"3","author":"E. Clarke","year":"1993","unstructured":"Clarke, E., Zhao, X.: Analytica: A theorem prover for Mathematica. Mathematica Journal\u00a03(1), 56\u201371 (1993)","journal-title":"Mathematica Journal"},{"key":"18_CR9","unstructured":"Daumas, M., Mu\u00f1oz, C., Lester, D.: Verified real number calculations: A library for integer arithmetic, \n                      \n                        http:\/\/hal.archives-ouvertes.fr\/hal-00168402\/fr\/"},{"key":"18_CR10","unstructured":"Dolzmann, A., Sturm, T., Weispfenning, V.: Real quantifier elimination in practice. Technical Report MIP-9720, Universit\u00e4t Passau, D-94030, Germany (1997)"},{"key":"18_CR11","unstructured":"Harrison, J.: Formalized mathematics. Technical Report\u00a036, Turku Centre for Computer Science (TUCS), Lemmink\u00e4isenkatu 14 A, FIN-20520 Turku, Finland (1996), \n                      \n                        http:\/\/www.cl.cam.ac.uk\/jrh13\/papers\/form-math3.html"},{"key":"18_CR12","unstructured":"Hong, H.: QEPCAD \u2014 quantifier elimination by partial cylindrical algebraic decomposition. Sources and documentation are on the Internet, \n                      \n                        http:\/\/www.cs.usna.edu\/qepcad\/B\/QEPCAD.html"},{"key":"18_CR13","volume-title":"The Analysis of Linear Partial Differential Operators II: Differential Operators with Constant Coefficient","author":"L. H\u00f6rmander","year":"2006","unstructured":"H\u00f6rmander, 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]"},{"key":"18_CR14","unstructured":"Hurd, J.: Metis first order prover (2007), \n                      \n                        http:\/\/gilith.com\/software\/metis\/"},{"key":"18_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-75560-9_26","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Ludwig","year":"2007","unstructured":"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.\u00a04790, pp. 348\u2013362. Springer, Heidelberg (2007)"},{"issue":"2","key":"18_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1005843632307","volume":"18","author":"W. McCune","year":"1997","unstructured":"McCune, W., Wos, L.: Otter: The CADE-13 competition incarnations. Journal of Automated Reasoning\u00a018(2), 211\u2013220 (1997)","journal-title":"Journal of Automated Reasoning"},{"key":"18_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/11532231_22","volume-title":"Automated Deduction \u2013 CADE-20","author":"S. McLaughlin","year":"2005","unstructured":"McLaughlin, S., Harrison, J.: A proof-producing decision procedure for real arithmetic. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 295\u2013314. Springer, Heidelberg (2005)"},{"key":"18_CR18","unstructured":"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.\u00a0192, pp. 18\u201333 (2006)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85110-3_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:41Z","timestamp":1619522081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85110-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851097","9783540851103"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85110-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}