{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:55Z","timestamp":1725488935442},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439318"},{"type":"electronic","value":"9783540456209"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45620-1_27","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T07:18:26Z","timestamp":1186903106000},"page":"314-331","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Recursive Path Orderings Can Be Context-Sensitive"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Borralleras","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Rubio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,4]]},"reference":[{"key":"27_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":"27_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-60939-3_17","volume-title":"Fifth International Workshop on Logic Program Synthesis and Transformation","author":"T. Arts","year":"1996","unstructured":"Thomas Arts and Hans Zantema. Termination of logic programs using semantic unification. Fifth International Workshop on Logic Program Synthesis and Transformation, LNCS 1048:219\u2013233. Springer, 1996."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewriting and all that. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"C. Borralleras, S. Lucas and A. Rubio. Recursive Path Orderings can be Context-Sensitive. Available at \n                    http:\/\/www.lsi.upc.es\/~albert\/papers.html\n                    \n                  , 2002. Long version.","DOI":"10.1007\/3-540-45620-1_27"},{"issue":"2","key":"27_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/0304-3975(92)90022-8","volume":"103","author":"M. Dauchet","year":"1992","unstructured":"Max Dauchet. Simulation of turing machines by a regular rewrite rule. Theoretical Computer Science, 103(2):409\u2013420, 1992.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279\u2013301, 1982.","journal-title":"Theoretical Computer Science"},{"key":"27_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 10th International Conference on Rewriting Techniques and Applications","author":"M.C.F. Ferreira","year":"1999","unstructured":"M.C.F. Ferreira and A.L. Ribeiro. Context-Sensitive AC-Rewriting. Proc. of 10th International Conference on Rewriting Techniques and Applications, LNCS 1631:286\u2013300, Springer, 1999."},{"key":"27_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 10th International Conference on Rewriting Techniques and Applications","author":"J. Giesl","year":"1999","unstructured":"J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. Proc. of 10th International Conference on Rewriting Techniques and Applications, LNCS 1631:271\u2013285, Springer, 1999."},{"key":"27_CR9","unstructured":"J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. Proc. of 1th International Workshop on Rewriting Proof and Computation, RPC\u201901, pages 14\u201333, RIEC, Tohoku University, 2001."},{"key":"27_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/3-540-44802-0_34","volume-title":"Proc. 15th Int. Workshop Computer Science Logic","author":"J. Goubault-Larrecq","year":"2001","unstructured":"Jean Goubault-Larrecq. Well-Founded Recursive Relations. Proc. 15th Int. Workshop Computer Science Logic, LNCS 2142:484\u2013497, Springer, 2001."},{"key":"27_CR11","series-title":"Lect Notes Comput Sci","first-page":"113","volume-title":"Proc. of 3rd International Workshop on Conditional Term Rewriting Systems","author":"H. Ganzinger","year":"1993","unstructured":"Harald Ganzinger and Uwe Waldmann. Termination proofs of well-moded logic programs via conditional rewrite systems. Proc. of 3rd International Workshop on Conditional Term Rewriting Systems, LNCS 656:113\u2013127, Springer, 1993."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, pages 263\u2013297. Pergamon Press, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"27_CR13","unstructured":"J. Kennaway and F.J. de Vries. Infinitary rewriting. In Term Rewriting Systems. Cambridge University Press, 2002. To appear."},{"key":"27_CR14","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 23rd. International Colloquium on Automata, Languages and Programming, ICALP\u201996","author":"S. Lucas","year":"1996","unstructured":"S. Lucas. Termination of context-sensitive rewriting by rewriting. Proc. of 23rd. International Colloquium on Automata, Languages and Programming, ICALP\u201996, LNCS 1099:122\u2013133, Springer, 1996."},{"issue":"1","key":"27_CR15","first-page":"1","volume":"1998","author":"S. Lucas","year":"1998","unstructured":"S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1): 1\u201361, 1998.","journal-title":"Journal of Functional and Logic Programming"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"S. Lucas. Termination of Rewriting With Strategy Annotations. Proc. of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LNAI 2250:669\u2013684, Springer, 2001.","DOI":"10.1007\/3-540-45653-8_46"},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1017\/S0305004100003844","volume":"59","author":"C. St","year":"1963","unstructured":"C. St. J. A. Nash-Williams. On well-quasi-ordering finite trees. Proceedings of the Cambridge Philosophical Society, 59(4):833\u2013835, 1963.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"27_CR18","unstructured":"J. Steinbach and H. Xi. Freezing \u2014 Termination Proofs for Classical, Context-Sensitive and Innermost Rewriting. Institut f\u00fcr Informatik, T.U. M\u00fcnchen, 1998."},{"key":"27_CR19","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 8th International Conference on Rewriting Techniques and Applications, RTA\u201997","author":"H. Zantema","year":"1997","unstructured":"H. Zantema. Termination of Context-Sensitive Rewriting. Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA\u201997, LNCS 1232:172\u2013186, Springer, 1997."}],"container-title":["Lecture Notes in Computer Science","Automated Deduction\u2014CADE-18"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45620-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:53:07Z","timestamp":1558486387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45620-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439318","9783540456209"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45620-1_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"4 July 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}