{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:25:58Z","timestamp":1725492358241},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755586"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75560-9_6","type":"book-chapter","created":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T05:36:46Z","timestamp":1191649006000},"page":"47-61","source":"Crossref","is-referenced-by-count":10,"title":["Extending a Resolution Prover for Inequalities on Elementary Functions"],"prefix":"10.1007","author":[{"given":"Behzad","family":"Akbarpour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence C.","family":"Paulson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","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":"6_CR2","doi-asserted-by":"crossref","unstructured":"Avigad, J., Donnelly, K., Gray, D., Raff, P.: A formally verified proof of the prime number theorem. ACM Transactions on Computational Logic (in press)","DOI":"10.1145\/1297658.1297660"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Avigad, J., Friedman, H.: Combining decision procedures for the reals. Logical Methods in Computer Science\u00a02(4) (2006)","DOI":"10.2168\/LMCS-2(4:4)2006"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/B978-044450813-3\/50004-7","volume-title":"Handbook of Automated Reasoning","author":"L. Bachmair","year":"2001","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0I, ch. 2, pp. 19\u201399. Elsevier Science, Amsterdam (2001)"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0049-237X(08)71097-8","volume-title":"Handbook of Mathematical Logic","author":"J. Barwise","year":"1977","unstructured":"Barwise, J.: An introduction to first-order logic. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 5\u201346. North-Holland, Amsterdam (1977)"},{"issue":"4","key":"6_CR6","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":"6_CR7","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"},{"issue":"1","key":"6_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":"6_CR9","unstructured":"Dolzmann, A., Sturm, T., Weispfenning, V.: Real quantifier elimination in practice. Technical Report MIP-9720, Universit\u00e4t Passau, D-94030, Germany (1997)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-540-45069-6_34","volume-title":"Computer Aided Verification","author":"C. Flanagan","year":"2003","unstructured":"Flanagan, C., Joshi, R., Ou, X., Saxe, J.B.: Theorem proving using lazy proof explication. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 355\u2013367. Springer, Heidelberg (2003)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/11541868_7","volume-title":"Theorem Proving in Higher Order Logics","author":"B. Gr\u00e9goire","year":"2005","unstructured":"Gr\u00e9goire, B., Mahboubi, A.: Proving equalities in a commutative ring done right in coq. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, pp. 98\u2013113. Springer, Heidelberg (2005)"},{"key":"6_CR12","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 [15]"},{"key":"6_CR13","unstructured":"Hurd, J.: Metis first order prover (2007), \n                  \n                    http:\/\/gilith.com\/software\/metis\/"},{"issue":"2","key":"6_CR14","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":"6_CR15","series-title":"Lecture Notes in Artificial Intelligence","first-page":"295","volume-title":"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-20. LNCS (LNAI), vol.\u00a03632, pp. 295\u2013314. Springer, Heidelberg (2005)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Isabelle\/HOL","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M. (eds.): Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"6_CR17","unstructured":"Prevosto, V., Waldmann, U.: SPASS+T. In: Sutcliffe, G., Schmidt, R., Schulz, S.: (eds.) FLoC 2006 Workshop on Empirically Successful Computerized Reasoning, vol. 192 of CEUR Workshop Proceedings, pp. 18\u201333 (2006)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75560-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:24:49Z","timestamp":1619519089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75560-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755586"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75560-9_6","relation":{},"subject":[]}}