{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:40Z","timestamp":1749124060763},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019343X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0012861","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:12:39Z","timestamp":1132726359000},"page":"602-621","source":"Crossref","is-referenced-by-count":13,"title":["Argument-bounded algorithms as a basis for automated termination proofs"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Walther","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Aubin, R. Mechanizing Structural Induction. Theoretical Computer Science, vol 9, 1979.","DOI":"10.1016\/0304-3975(79)90034-3"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Biundo, S., Hummel, B., Hutter, D. and Walther, C. The Karlsruhe Induction Theorem Proving System. Proceedings 8th CADE, Springer Lecture Notes Comp. Sc., vol. 230, 1986.","DOI":"10.1007\/3-540-16780-3_132"},{"key":"42_CR3","unstructured":"Boyer, R.S. and J S. Moore A computational Logic. Academic Press, 1979."},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Cohn, P.M. Universal Algebra. D. Reidel, 1981.","DOI":"10.1007\/978-94-009-8399-1"},{"key":"42_CR5","unstructured":"Goguen, J.A., Thatcher, J.W. and Wagner, E.G. An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types. In Current Trends in Programming Methodology, R.T. Yeh (Ed.), Prentice Hall, 1978."},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Huet, G. and Oppen, D.C. Equations and Rewrite Rules: A Survey. In Formal Language Theory: Perspectives and Open Problems, R. Book (Ed.), Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"Kapur, D. and Musser, D.R. Proof by Consistency. Artificial Intelligence, vol 31, no 2, 1987.","DOI":"10.1016\/0004-3702(87)90017-8"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"McCarthy, J., Abrahams, P.W., Edwards, D.J., Hart, T.P. and Levin, M.I. LISP 1.5 Programmers's Manual. The MIT Press, 1962.","DOI":"10.21236\/AD0406138"},{"key":"42_CR9","unstructured":"Mill, M. Implementierung eines Verfahrens f\u00fcr Terminierungsbeweise. Diplomarbeit, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 1987."},{"key":"42_CR10","unstructured":"Sonderforschungsbereich (SFB) 314 Arbeits-und Ergebnisbericht f\u00fcr die Jahre 1985\u20131986\u20131987. Universit\u00e4t Karlsruhe, 1987."},{"key":"42_CR11","unstructured":"Steele, G.L. Common Lisp \u2014 The Language. Digital Press, 1984."},{"key":"42_CR12","unstructured":"Walther, C. Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. Interner Bericht 17\/87, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 1987."},{"key":"42_CR13","unstructured":"Winston, P.H. Artificial Intelligence. Addison-Wesley, 1984."}],"container-title":["Lecture Notes in Computer Science","9th International Conference on Automated Deduction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0012861","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:24:19Z","timestamp":1586579059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019343X"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0012861","relation":{},"subject":[]}}