{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:54Z","timestamp":1761611214144,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439165"},{"type":"electronic","value":"9783540456100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45610-4_21","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T06:47:11Z","timestamp":1186901231000},"page":"296-310","source":"Crossref","is-referenced-by-count":11,"title":["Termination of (Canonical) Context-Sensitive Rewriting"],"prefix":"10.1007","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,9]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"T. Arts and J. Giesl. Termination of Term Rewriting Using Dependency Pairs Theoretical Computer Science, 236:133\u2013178, 2000.","journal-title":"Theoretical Computer Science"},{"key":"21_CR2","volume-title":"TR AIB-2001-09","author":"T. Arts","year":"2001","unstructured":"T. Arts and J. Giesl. A collection of examples for termination of term rewriting using dependency pairs. TR AIB-2001-09, RWTH Aachen, 2001."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"C. Borralleras, S. Lucas, and A. Rubio. Recursive Path Orderings can be Context-Sensitive. Proc. of CADE\u201902, Springer LNAI to appear, 2002.","DOI":"10.1007\/3-540-45620-1_27"},{"key":"21_CR4","first-page":"69","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz. Termination of rewriting. JSC, 3:69\u2013115, 1987.","journal-title":"JSC"},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-59340-3_2","volume-title":"33 Examples of Termination","author":"N. Dershowitz","year":"1995","unstructured":"N. Dershowitz. 33 Examples of Termination. LNCS 909:16\u201326, Springer-Verlag, Berlin, 1995."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90040-9","volume":"83","author":"N. Dershowitz","year":"1991","unstructured":"N. Dershowitz, S. Kaplan, and D. Plaisted. Rewrite, rewrite, rewrite, rewrite, rewrite. Theoretical Computer Science 83:71\u201396, 1991.","journal-title":"Theoretical Computer Science"},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-48685-2_24","volume-title":"Proc. of RTA\u201999","author":"M.C.F. Ferreira","year":"1999","unstructured":"M.C.F. Ferreira and A.L. Ribeiro. Context-Sensitive AC-Rewriting. Proc. of RTA\u201999, LNCS 1631:286\u2013300, Springer-Verlag, Berlin, 1999."},{"key":"21_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/3-540-48685-2_23","volume-title":"Proc. of RTA\u201999","author":"J. Giesl","year":"1999","unstructured":"J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. Proc. of RTA\u201999, LNCS 1631:271\u2013285, Springer-Verlag, Berlin, 1999."},{"key":"21_CR9","unstructured":"J. Giesl and A. Middeldorp. Transformation Techniques for Context-Sensitive Rewrite Systems. Technical Report AIB-2002-02, Aachen, 2002."},{"key":"21_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-61440-0_122","volume-title":"Proc. of ICALP\u201996","author":"S. Lucas","year":"1996","unstructured":"S. Lucas. Termination of context-sensitive rewriting by rewriting. Proc. of ICALP\u201996, LNCS 1099:122\u2013133, Springer-Verlag, Berlin, 1996."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1):1\u201361, January 1998.","DOI":"10.1142\/9789814528849"},{"key":"21_CR12","unstructured":"S. Lucas. Context-sensitive rewriting strategies. Information and Computation, to appear."},{"key":"21_CR13","unstructured":"J. Steinbach and H. Xi. Freezing-Termination Proofs for Classical, Context-Sensitive and Innermost Rewriting. Institut f\u00fcr Informatik, T.U. M\u00fcnchen, January 1998."},{"key":"21_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/3-540-62950-5_69","volume-title":"Proc. of RTA\u2019 97","author":"H. Zantema","year":"1997","unstructured":"H. Zantema. Termination of Context-Sensitive Rewriting. Proc. of RTA\u2019 97, LNCS 1232:172\u2013186, Springer-Verlag, Berlin, 1997."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45610-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:50:17Z","timestamp":1737363017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45610-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439165","9783540456100"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45610-4_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}