{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:06Z","timestamp":1725493446647},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664925"},{"type":"electronic","value":"9783540482420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48242-3_16","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:28:09Z","timestamp":1184603289000},"page":"258-272","source":"Crossref","is-referenced-by-count":1,"title":["Extensions to the Estimation Calculus"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Gow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Bundy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Green","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"J. Brauburger and J. Giesl. Termination analysis by inductive evaluation. In C. Kirchner and H. Kirchner, editors, 15th International Conference on Automated Deduction, pages 254\u2013269. LNAI 1421, Springer-Verlag, 1998.","DOI":"10.1007\/BFb0054264"},{"key":"16_CR2","unstructured":"The DReaM Group. The Clam proof planner, user manual and programmer manual (version 2.8.1), April 1999. Available from \n                    ftp:\/\/dream.dai.ed.ac.uk\/pub\/oyster-clam\/manual.ps.gz\n                    \n                  ."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"J. Giesl. Automated termination proofs with measure functions. In I. Wachsmuth, C. Rollinger, and W. Brauer, editors, 19th Annual German Conference on Artificial Intelligence, pages 149\u2013160. LNAI 981, Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60343-3_33"},{"key":"16_CR4","series-title":"Lect Notes Comput Sci","volume-title":"2nd International Static Analysis Symposium","author":"J. Giesl","year":"1995","unstructured":"J. Giesl. Termination analysis for functional programs using term orderings. In 2nd International Static Analysis Symposium. LNCS 983, Springer-Verlag, 1995."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1005797629953","volume":"19","author":"J. Giesl","year":"1997","unstructured":"J. Giesl. Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning, 19:1\u201329, 1997.","journal-title":"Journal of Automated Reasoning"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"J. Giesl, C. Walther, and J. Brauburger. Termination analysis for functional programs. In W. Bibel and P.H. Schmitt, editors, Automated Deduction \u2014 A Basis for Applications, Vol III: Applications, volume 10 of Applied Logic Series, chapter 6, pages 135\u2013164. Kluwer Academic, 1998.","DOI":"10.1007\/978-94-017-0437-3_6"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"David McAllester and Kostas Arkoudas. Walther recursion. In M.A. McRobbie and J.K. Slaney, editors, 13th International Conference on Automated Deduction, pages 643\u2013657. LNAI 1104, Springer Verlag, July 1996.","DOI":"10.1007\/3-540-61511-3"},{"key":"16_CR8","unstructured":"L.C. Paulson. ML for the Working Programmer. Cambridge University Press, 1991."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"C. Sengler. Termination of algorithms over non-freely generated datatypes. In M.A. McRobbie and J.K. Slaney, editors, 13th International Conference on Automated Deduction, pages 121\u2013135. LNAI 1104, Springer Verlag, July 1996.","DOI":"10.1007\/3-540-61511-3_73"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0004-3702(94)90063-9","volume":"71","author":"C. Walther","year":"1994","unstructured":"C. Walther. On proving termination of algorithms by machine. Artificial Intelligence, 71(1):101\u2013157, 1994.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48242-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T01:49:55Z","timestamp":1550454595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48242-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664925","9783540482420"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48242-3_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}