{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:44Z","timestamp":1725664244825},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615118"},{"type":"electronic","value":"9783540686873"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61511-3_73","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:50:00Z","timestamp":1330275000000},"page":"121-135","source":"Crossref","is-referenced-by-count":7,"title":["Termination of algorithms over non-freely generated data types"],"prefix":"10.1007","author":[{"given":"Claus","family":"Sengler","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"R. Aubin. Mechanizing Structural Induction. Part I and II. Theoretical Computer Science, 9, 1979.","DOI":"10.1016\/0304-3975(79)90035-5"},{"key":"10_CR2","unstructured":"R.S. Boyer and J S. Moore. A Computational Logic. Academic Press, 1979."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam System. In CADE 10. Springer Verlag, 1990.","DOI":"10.1007\/3-540-52885-7_123"},{"key":"10_CR4","first-page":"185","volume":"No. 62","author":"A. Bundy","year":"1993","unstructured":"A. Bundy, A. Stevens, F. v. Harmelen, A. Ireland, and A. Smaill. Rippling: a heuristic for guiding inductive proofs. JAI, pp. 185\u2013253, No. 62, 1993.","journal-title":"JAI"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"P.M. Cohn. Universal Algebra. D. Reidel, 1981.","DOI":"10.1007\/978-94-009-8399-1"},{"key":"10_CR6","unstructured":"J. Giesl. Automatisierung von Terminierungsbeweisen f\u00fcr rekursiv definierte Algorithmen. Ph.D. Thesis, infix Verlag, 1995."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"J. Giesl. Termination Analysis for Functional Programs using Term Orderings. In 2nd International Static Analysis Symposium. Springer Verlag, 1995.","DOI":"10.1007\/3-540-60360-3_38"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"D. Hutter. Guiding Induction Proofs. In CADE 10. Springer Verlag, 1990.","DOI":"10.1007\/3-540-52885-7_85"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"D. Hutter and C. Sengler. INKA: The Next Generation. In CADE 13, 1996.","DOI":"10.1007\/3-540-61511-3_92"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0004-3702(87)90017-8","volume":"31","author":"D. Kapur","year":"1987","unstructured":"D. Kapur and D.R. Musser. Proof by Consistency. Artificial Intelligence, pp. 125\u2013157, 31(2), 1987.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1145\/29873.30399","volume":"9","author":"J. Loeckx","year":"1987","unstructured":"J. Loeckx. Algorithmic Specifications: A Constructive Specification Method for Abstract Data Types. ACM Transactions on Programming Languages and Systems, pp 646\u2013685, 9(4), 1987.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"U.S. Reddy. Term Rewriting Induction. In CADE 10. Springer Verlag, 1990.","DOI":"10.1007\/3-540-52885-7_86"},{"key":"10_CR13","unstructured":"C. Sengler. Induction on Non-freely Generated Data Types. Technical Report RR-96-01, German Research Center for Artificial Intelligence, 1996."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"C. Walther. Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. In CADE 9. Springer Verlag, 1988.","DOI":"10.1007\/BFb0012861"},{"key":"10_CR15","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 the Termination of Algorithms by Machine. Artificial Intelligence, pp 101\u2013157, 71, 1994.","journal-title":"Artificial Intelligence"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"H. Zhang, D. Kapur, and M.S. Krishnamoorthy. A Mechanizable Induction Principle For Equational Specifications. In CADE 9. Springer-Verlag, 1988.","DOI":"10.1007\/BFb0012831"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 Cade-13"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61511-3_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:07:21Z","timestamp":1605629241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61511-3_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615118","9783540686873"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-61511-3_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}