{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:46Z","timestamp":1725566746575},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_37","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"541-556","source":"Crossref","is-referenced-by-count":15,"title":["Confluence of Shallow Right-Linear Rewrite Systems"],"prefix":"10.1007","author":[{"given":"Guillem","family":"Godoy","sequence":"first","affiliation":[]},{"given":"Ashish","family":"Tiwari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1093\/logcom\/4.3.217","volume":"4","author":"L. Bachmair","year":"1994","unstructured":"Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. J. of Logic and Computation\u00a04, 217\u2013247 (1994)","journal-title":"J. of Logic and Computation"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-48224-5_3","volume-title":"Automata, Languages and Programming","author":"A. Bouajjani","year":"2001","unstructured":"Bouajjani, A.: Languages, rewriting systems, and verification of infinite-state systems. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 24\u201339. Springer, Heidelberg (2001)"},{"key":"37_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"1","key":"37_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1994.1043","volume":"111","author":"H. Comon","year":"1994","unstructured":"Comon, H., Haberstrau, M., Jouannaud, J.-P.: Syntacticness, cyclesyntacticness, and shallow theories. Information and Computation\u00a0111(1), 154\u2013191 (1994)","journal-title":"Information and Computation"},{"key":"37_CR5","series-title":"Formal Models and Semantics","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Amsterdam. Formal Models and Semantics, vol.\u00a0B, pp. 243\u2013320. North-Holland, Amsterdam (1990)"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/3-540-44881-0_23","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2003","unstructured":"Giesl, J., Zantema, H.: Liveness in rewriting. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 321\u2013336. Springer, Heidelberg (2003)"},{"key":"37_CR7","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":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-36494-3_9","volume-title":"STACS 2003","author":"G. Godoy","year":"2003","unstructured":"Godoy, G., Tiwari, A., Verma, R.: On the confluence of linear shallow term rewrite systems. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 85\u201396. Springer, Heidelberg (2003)"},{"issue":"1-3","key":"37_CR9","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"},{"issue":"5","key":"37_CR10","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":"37_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(01)00357-7","volume":"285","author":"N. Mart\u00ed-Oliet","year":"2002","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J.: Rewriting logic: roadmap and bibliography. Theor. Comput. Sci.\u00a0285(2), 121\u2013154 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/LICS.1996.561464","volume-title":"Proc. 11th IEEE Symp. on Logic In Comp. Sc. LICS","author":"R. Nieuwenhuis","year":"1996","unstructured":"Nieuwenhuis, R.: Basic paramodulation and decidable theories. In: Proc. 11th IEEE Symp. on Logic In Comp. Sc. LICS, pp. 473\u2013483. IEEE Computer Society, Los Alamitos (1996)"},{"key":"37_CR13","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","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:54:19Z","timestamp":1619506459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11538363_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}