{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:11:36Z","timestamp":1649135496843},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,9,16]],"date-time":"2012-09-16T00:00:00Z","timestamp":1347753600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10817-012-9262-5","type":"journal-article","created":{"date-parts":[[2012,9,15]],"date-time":"2012-09-15T16:46:25Z","timestamp":1347727585000},"page":"281-324","source":"Crossref","is-referenced-by-count":0,"title":["Non-Linear Rewrite Closure and Weak Normalization"],"prefix":"10.1007","volume":"51","author":[{"given":"Carles","family":"Creus","sequence":"first","affiliation":[]},{"given":"Guillem","family":"Godoy","sequence":"additional","affiliation":[]},{"given":"Francesc","family":"Massanes","sequence":"additional","affiliation":[]},{"given":"Ashish","family":"Tiwari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,16]]},"reference":[{"key":"9262_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"9262_CR2","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on: www.grappa.univ-lille3.fr\/tata (2007). Accessed 12 Oct 2007"},{"issue":"1","key":"9262_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0890-5401(03)00134-2","volume":"187","author":"H Comon","year":"2003","unstructured":"Comon, H., Jacquemard, F.: Ground reducibility is EXPTIME-complete. Inf. Comput. 187(1), 123\u2013153 (2003)","journal-title":"Inf. Comput."},{"key":"9262_CR4","doi-asserted-by":"crossref","unstructured":"Creus, C., Godoy, G., Massanes, F., Tiwari, A.: Non-linear rewrite closure and weak normalization. In: LICS, pp. 365\u2013374 (2009)","DOI":"10.1109\/LICS.2009.9"},{"issue":"2","key":"9262_CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1006\/jsco.1995.1048","volume":"20","author":"M Dauchet","year":"1995","unstructured":"Dauchet, M., Caron, A.C., Coquid\u00e9, J.L.: Automata for reduction properties solving. J. Symb. Comput. 20(2), 215\u2013233 (1995)","journal-title":"J. Symb. Comput."},{"key":"9262_CR6","first-page":"200","volume-title":"Rewriting Techniques and Applications (RTA)","author":"G Godoy","year":"2007","unstructured":"Godoy, G., Huntingford, E., Tiwari, A.: Termination of rewriting with right-flat rules. In: Rewriting Techniques and Applications (RTA), pp. 200\u2013213. Springer, Paris (2007)"},{"key":"9262_CR7","doi-asserted-by":"crossref","unstructured":"Godoy, G., Tison, S.: On the normalization and unique normalization properties of term rewrite systems. In: Conference on Automated Deduction (CADE), pp. 247\u2013262. Springer, Bremen (2007)","DOI":"10.1007\/978-3-540-73595-3_17"},{"key":"9262_CR8","doi-asserted-by":"crossref","unstructured":"Godoy, G., Tiwari, A.: Deciding fundamental properties of right-(ground or variable) rewrite systems by rewrite closure. In: International Joint Conference on Automated Reasoning (IJCAR), pp. 91\u2013106. Springer, Cork (2004)","DOI":"10.1007\/978-3-540-25984-8_5"},{"key":"9262_CR9","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/11538363_37","volume-title":"Computer Science Logic (CSL)","author":"G Godoy","year":"2005","unstructured":"Godoy, G., Tiwari, A.: Confluence of shallow right-linear rewrite systems. In: Computer Science Logic (CSL), pp. 541\u2013556. Springer, Oxford (2005)"},{"issue":"1","key":"9262_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s00200-004-0148-6","volume":"15","author":"G Godoy","year":"2004","unstructured":"Godoy, G., Tiwari, A., Verma, R.: Characterizing confluence by rewrite closure and right ground term rewrite systems. Appl. Algebra Eng. Commun. Comput. 15(1), 13\u201336 (2004)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"2","key":"9262_CR11","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1006\/inco.2002.3157","volume":"178","author":"T Nagaya","year":"2002","unstructured":"Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. Inf. Comput. 178(2), 499\u2013514 (2002)","journal-title":"Inf. Comput."},{"key":"9262_CR12","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/10721975_17","volume-title":"Rewriting Techniques and Applications (RTA)","author":"T Takai","year":"2000","unstructured":"Takai, T., Kaji, Y., Seki, H.: Right-linear finite path overlapping term rewriting systems effectively preserve recognizability. In: Rewriting Techniques and Applications (RTA), pp. 246\u2013260. Springer, Norwich (2000)"},{"issue":"5","key":"9262_CR13","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1587\/transinf.E93.D.953","volume":"93-D","author":"K Uchiyama","year":"2010","unstructured":"Uchiyama, K., Sakai, M., Sakabe, T.: Decidability of termination and innermost termination for term rewriting systems with right-shallow dependency pairs. IEICE Trans. 93-D(5), 953\u2013962 (2010)","journal-title":"IEICE Trans."},{"key":"9262_CR14","first-page":"343","volume-title":"Rewriting Techniques and Applications (RTA)","author":"Y Wang","year":"2006","unstructured":"Wang, Y., Sakai, M.: Decidability of termination for semi-constructor TRSs, left-linear shallow TRSs and related systems. In: Rewriting Techniques and Applications (RTA), pp. 343\u2013356. Springer, Seattle (2006)"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-012-9262-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10817-012-9262-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-012-9262-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T00:04:34Z","timestamp":1562198674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10817-012-9262-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,16]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9262"],"URL":"https:\/\/doi.org\/10.1007\/s10817-012-9262-5","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,16]]}}}