{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:22:06Z","timestamp":1743060126183,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230243"},{"type":"electronic","value":"9783540301240"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30124-0_11","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T12:27:59Z","timestamp":1267532879000},"page":"100-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A General Theorem on Termination of Rewriting"],"prefix":"10.1007","author":[{"given":"Jeremy E.","family":"Dawson","sequence":"first","affiliation":[]},{"given":"Rajeev","family":"Gor\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science\u00a0236, 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/10721959_27","volume-title":"Automated Deduction - CADE-17","author":"C. Borralleras","year":"2000","unstructured":"Borralleras, C., Ferreira, M., Rubio, A.: Complete Monotonic Semantic Path Orderings. In: McAllester, D. (ed.) CADE 2000. LNCS, vol.\u00a01831, pp. 346\u2013364. Springer, Heidelberg (2000)"},{"key":"11_CR3","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"16","volume-title":"Computing: The Australasian Theory Symposium","author":"J.E. Dawson","year":"2003","unstructured":"Dawson, J.E., Gor\u00e9, R.: A New Machine-checked Proof of Strong Normalisation for Display Logic. In: Computing: The Australasian Theory Symposium. Electronic Notes in Theoretical Computer Science, vol.\u00a078, pp. 16\u201335. Elsevier, Amsterdam (2003)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45685-6_10","volume-title":"Theorem Proving in Higher Order Logics","author":"J.E. Dawson","year":"2002","unstructured":"Dawson, J.E., Gor\u00e9, R.: Formalised cut admissibility for display logic. In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol.\u00a02410, pp. 131\u2013147. Springer, Heidelberg (2002)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-59340-3_2","volume-title":"Term Rewriting","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N.: 33 Examples of Termination. In: Comon, H., Jouannaud, J.-P. (eds.) TCS School 1993. LNCS, pp. 16\u201325. Springer, Heidelberg (1995)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(94)00275-4","volume":"142","author":"N. Dershowitz","year":"1995","unstructured":"Dershowitz, N., Hoot, C.: Natural Termination. Theoretical Computer Science\u00a0142, 179\u2013207 (1995)","journal-title":"Theoretical Computer Science"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/B978-044450813-3\/50011-4","volume-title":"Handbook of Automated Reasoning","author":"N. Dershowitz","year":"2001","unstructured":"Dershowitz, N., Plaisted, D.A.: Rewriting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 535\u2013610. Elsevier, Amsterdam (2001)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1093\/jigpal\/6.2.195","volume":"6","author":"H. Doornbos","year":"1998","unstructured":"Doornbos, H., Von Karger, B.: On the Union ofWell-Founded Relations. L. J. of the IGPL\u00a06, 195\u2013201 (1998)","journal-title":"L. J. of the IGPL"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-60381-6_7","volume-title":"Conditional and Typed Rewriting Systems","author":"M.C.F. Ferreira","year":"1995","unstructured":"Ferreira, M.C.F., Zantema, H.: Well-foundedness of Term Orderings. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol.\u00a0968, pp. 106\u2013123. Springer, Heidelberg (1995)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/3-540-44802-0_34","volume-title":"Computer Science Logic","author":"J. Goubault-Larrecq","year":"2001","unstructured":"Goubault-Larrecq, J.: Well-founded recursive relations. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 484\u2013497. Springer, Heidelberg (2001)"},{"key":"11_CR11","unstructured":"Kamin, S., L\u00e9vy, J.-J.: Two generalizations of the recursive path ordering. Unpublished, Department of Computer Science, University of Illinois (1980)"},{"key":"11_CR12","unstructured":"Pfenning, F.: Structural Cut Elimination. In: Proc. LICS 1994 (1994)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30124-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T20:02:57Z","timestamp":1579723377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"9 September 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}