{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:23:49Z","timestamp":1756189429028},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253884"},{"type":"electronic","value":"9783540319825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31982-5_30","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T07:29:02Z","timestamp":1294990142000},"page":"470-489","source":"Crossref","is-referenced-by-count":3,"title":["Confluence of Right Ground Term Rewriting Systems Is Decidable"],"prefix":"10.1007","author":[{"given":"Lukasz","family":"Kaiser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Comon, H., Godoy, G., Nieuwenhuis, R.: The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. In: 42nd Annual IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, USA (2001)","DOI":"10.1109\/SFCS.2001.959904"},{"key":"30_CR2","unstructured":"Comon, H., Jacquemard, F., Dauchet, M., Lugiez, D., Gilleron, R., Tison, S., Tomassi, M.: Tree Automata Techniques and Applications, available on internet under, \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata\/"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Comon, H., Narendran, P., Nieuwenhuis, R., Rusinowitch, M.: Decision Problems in Ordered Rewriting. In: IEEE Symposium on Logic in Computer Science, Indianapolis, IN, USA (1998)","DOI":"10.1109\/LICS.1998.705664"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Comon, H., Narendran, P., Nieuwenhuis, R., Rusinowitch, M.: Deciding the Confluence of Ordered Term Rewrite Systems. ACM Transactions on Computational Logic, 33\u201355 (2003)","DOI":"10.1145\/601775.601777"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Dauchet, M., Tison, S.: The Theory of Ground Rewrite Systems is Decidable. In: IEEE Symposium on Logic in Computer Science, Philadelphia, PA (1990)","DOI":"10.1109\/LICS.1990.113750"},{"issue":"2","key":"30_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/976706.976712","volume":"5","author":"G. Godoy","year":"2004","unstructured":"Godoy, G., Nieuwenhuis, R., Tiwari, A.: Classes of Term Rewrite Systems with Polynomial Confluence Problems. ACM Transactions on Computational Logic\u00a05(2), 321\u2013331 (2004)","journal-title":"ACM Transactions on Computational Logic"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Godoy, G., Tiwari, A., Verma, R.: On the Confluence of Linear Shallow Term Rewrite Systems. In: Symposium on Theoretical Aspects of Computer Science, Berlin, Germany (2003)","DOI":"10.1007\/3-540-36494-3_9"},{"issue":"5","key":"30_CR8","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. Information Processing Letters\u00a087(5), 265\u2013270 (2003)","journal-title":"Information Processing Letters"},{"key":"30_CR9","unstructured":"Kaiser, L.: Confluence of Right Ground Term Rewriting Systems is Decidable, Masters Thesis, University of Wroclaw (June 2003)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Marcinkowski, J.: Undecidability of the First Order Theory of One-Step Right Ground Rewriting. In: Intl. Conference on Rewriting Techniques and Applications, Sitges, Spain (1997)","DOI":"10.1007\/3-540-62950-5_75"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0304-3975(87)90100-9","volume":"49","author":"M. Oyamaguchi","year":"1987","unstructured":"Oyamaguchi, M.: The Church-Rosser Property for Ground Term Rewriting Systems is Decidable. Theoretical Computer Science\u00a049(1), 43\u201379 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"30_CR12","first-page":"347","volume":"13","author":"M. Oyamaguchi","year":"1990","unstructured":"Oyamaguchi, M.: The Reachability and Joinability Problems for Right-Ground Term-Rewriting Systems. Journal of Information Processing\u00a013(3), 347\u2013354 (1990)","journal-title":"Journal of Information Processing"},{"key":"30_CR13","unstructured":"Tiwari, A.: Polynomial time Algorithms for Deciding Confluence of Certain Term Rewrite Systems. In: IEEE Symposium on Logic in Computer Science, Copenhagen, Denmark (2002)"},{"issue":"1","key":"30_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00200-004-0148-6","volume":"15","author":"A. Tiwari","year":"2004","unstructured":"Tiwari, A., Godoy, G., Verma, R.: Confluence Characterization Using Rewrite Closure with Application to Right Ground Systems. Applicable Algebra in Engeneering, Communication and Computing\u00a015(1), 13\u201336 (2004)","journal-title":"Applicable Algebra in Engeneering, Communication and Computing"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Verma, R., Rusinowitch, M., Lugiez, D.: Algorithms and Reductions for Rewriting Problems. In: Intl. Conference on Rewriting Techniques and Applications, Tsukuba, Japan (1998)","DOI":"10.1007\/BFb0052369"},{"key":"30_CR16","unstructured":"RTA list of open problems, available on internet under \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/~treinen\/rtaloop\/problems\/"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31982-5_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:44:44Z","timestamp":1620013484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31982-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253884","9783540319825"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31982-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}