{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:51:42Z","timestamp":1756191102722},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280057"},{"type":"electronic","value":"9783540318644"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11532231_12","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T14:56:52Z","timestamp":1279724212000},"page":"164-176","source":"Crossref","is-referenced-by-count":8,"title":["Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules"],"prefix":"10.1007","author":[{"given":"Guillem","family":"Godoy","sequence":"first","affiliation":[]},{"given":"Ashish","family":"Tiwari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2000)"},{"key":"12_CR2","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on (1997), \n                  \n                    http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"12_CR3","unstructured":"Contejean, E., Marche, C., Monate, B., Urbain, X.: CiME, \n                  \n                    http:\/\/cime.lri.fr\/"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/0304-3975(92)90022-8","volume":"103","author":"M. Dauchet","year":"1992","unstructured":"Dauchet, M.: Simulation of Turing machines by a regular rewrite rule. Theoretical Computer Science\u00a0103(2), 409\u2013420 (1992)","journal-title":"Theoretical Computer Science"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3-540-10843-2_36","volume-title":"Automata, Languages and Programming, 8th Colloquium, ICALP","author":"N. Dershowitz","year":"1981","unstructured":"Dershowitz, N.: Termination of linear rewriting systems. In: Automata, Languages and Programming, 8th Colloquium, ICALP. LNCS, vol.\u00a0115, pp. 448\u2013458. Springer, Heidelberg (1981)"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"Dershowitz, N.: Orderings for term rewriting systems. Theoretical computer science TCS\u00a017(3), 279\u2013301 (1982)","journal-title":"Theoretical computer science TCS"},{"issue":"1","key":"12_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1006\/inco.2002.3120","volume":"178","author":"A. Geser","year":"2002","unstructured":"Geser, A., Middeldorp, A., Ohlebusch, E., Zantema, H.: Relative undecidability in term rewriting, Part 1: The termination hierarchy. Information and Computation\u00a0178(1), 101\u2013131 (2002)","journal-title":"Information and Computation"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-25979-4_15","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automatic termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 210\u2013220. Springer, Heidelberg (2004)"},{"key":"12_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-540-25984-8_5","volume-title":"Automated Reasoning","author":"G. Godoy","year":"2004","unstructured":"Godoy, G., Tiwari, A.: Deciding fundamental properties of right-(Ground or variable) rewrite systems by rewrite closure. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 91\u2013106. Springer, Heidelberg (2004)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Computer Science Logic, CSL, (2005) (to appear)","DOI":"10.1007\/11538363_37"},{"issue":"1-3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.apal.2004.04.005","volume":"130","author":"G. Godoy","year":"2004","unstructured":"Godoy, G., Tiwari, A., Verma, R.: Deciding confluence of certain term rewriting systems in polynomial time. Annals of Pure and Applied Logic\u00a0130(1-3), 33\u201359 (2004)","journal-title":"Annals of Pure and Applied Logic"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-44881-0_22","volume-title":"Rewriting Techniques and Applications","author":"N. Hirokawa","year":"2003","unstructured":"Hirokawa, N., Middeldorp, A.: Tsukuba termination tool. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 311\u2013320. Springer, Heidelberg (2003)"},{"key":"12_CR13","unstructured":"Huet, G., Lankford, D.S.: On the uniform halting problem for term rewriting systems. INRIA, Le Chesnay, France, Technical Report 283 (1978)"},{"issue":"5","key":"12_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0020-0190(03)00310-7","volume":"87","author":"F. Jacquemard","year":"2003","unstructured":"Jacquemard, F.: Reachability and confluence are undecidable for flat term rewriting systems. Inf. Process. Lett.\u00a087(5), 265\u2013270 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01225647","volume":"6","author":"A. Middeldorp","year":"1995","unstructured":"Middeldorp, A., Gramlich, B.: Simple termination is difficult. Applicable Algebra in Engineering, Communication, and Computing AAECC\u00a06(2), 115\u2013128 (1995)","journal-title":"Applicable Algebra in Engineering, Communication, and Computing AAECC"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-56868-9_30","volume-title":"Rewriting Techniques and Applications","author":"D.A. Plaisted","year":"1993","unstructured":"Plaisted, D.A.: Polynomial time termination and constraint satisfaction tests. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol.\u00a0690, pp. 405\u2013420. Springer, Heidelberg (1993)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications","author":"T. Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 246\u2013260. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-20"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11532231_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:50:56Z","timestamp":1619491856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11532231_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280057","9783540318644"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11532231_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}