{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:03:43Z","timestamp":1737349423616,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421177"},{"type":"electronic","value":"9783540451273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45127-7_19","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:25:25Z","timestamp":1184603125000},"page":"246-260","source":"Crossref","is-referenced-by-count":1,"title":["The Unification Problem for Confluent Right-Ground Term Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Michio","family":"Oyamaguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshikatsu","family":"Ohta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,8]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1994.1043","volume":"111","author":"H. Comon","year":"1994","unstructured":"H. Comon, M. Haberstrau and J.-P. Jouannaud, Syntacticness, Cycle-Syntacticness and Shallow Theories, Information and Computation, 111(1), pp. 154\u2013191, 1994.","journal-title":"Information and Computation"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"M. Dauchet and S. Tison, The Theory of Ground Rewriting Systems is Decidable, Proc. 5th IEEE Symp. Logic in Computer Science, pp. 242\u2013248, 1990.","DOI":"10.1109\/LICS.1990.113750"},{"key":"19_CR3","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science, Vol. B, ed. J. van Leeuwen, pp. 243\u2013320, North-Holland, Amsterdam, 1990."},{"key":"19_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"Proc. 5th CADE","author":"J.-M. Hullot","year":"1980","unstructured":"J.-M. Hullot, Canonical Forms and Unification, Proc. 5th CADE, LNCS 87, pp. 318\u2013334, 1980."},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0052362","volume-title":"Proc. 9th Rewriting Techniques and Applications","author":"F. Jacquemard","year":"1998","unstructured":"F. Jacquemard, C. Meyer and C. Weidenbach, Unification in Extensions of Shallow Equational Theories, In Proc. 9th Rewriting Techniques and Applications, LNCS 1379, pp. 76\u201390, 1998."},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1006\/jsco.1997.0197","volume":"25","author":"A. Middeldorp","year":"1998","unstructured":"A. Middeldorp and S. Okui, A Deterministic Lazy Narrowing Calculus, Journal of Symbolic Computation 25(6), pp. 733\u2013757, 1998.","journal-title":"Journal of Symbolic Computation"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(96)00071-0","volume":"167","author":"A. Middeldorp","year":"1996","unstructured":"A. Middeldorp, S. Okui and T. Ida, Lazy Narrowing: Strong Completeness and Eager Variable Elimination, Theoret. Comput. Sci. 167, pp. 95\u2013130, 1996.","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"R. Nieuwenhuis, Basic Paramodulation and Decidable Theories, Proc. 11th Annual IEEE Symp. Logic in Computer Science, pp. 473\u2013482, 1996.","DOI":"10.1109\/LICS.1996.561464"},{"issue":"3","key":"19_CR9","first-page":"347","volume":"13","author":"M. Oyamaguchi","year":"1990","unstructured":"M. Oyamaguchi, The Reachability and Joinability Problems for Right-Ground Term-Rewriting Systems, Journal of Information Processing, Vol. 13,No. 3, pp. 347\u2013354, 1990.","journal-title":"Journal of Information Processing"},{"issue":"5","key":"19_CR10","first-page":"718","volume":"E73","author":"M. Oyamaguchi","year":"1990","unstructured":"M. Oyamaguchi, On the Word Problem for Right-Ground Term-Rewriting Systems, Trans. IEICE, Vol. E73,No. 5, pp. 718\u2013723, 1990.","journal-title":"Trans. IEICE"},{"key":"19_CR11","first-page":"99","volume":"20","author":"M. Oyamaguchi","year":"1995","unstructured":"M. Oyamaguchi and Y. Toyama, On the Church-Rosser Property of E-overlapping and Simple-Right-Linear TRS\u2019s, Research Reports of the Faculty of Engineering, Mie Univ., 20, pp. 99\u2013118, 1995.","journal-title":"Research Reports of the Faculty of Engineering, Mie Univ."},{"key":"19_CR12","unstructured":"A. Martelli and G. Rossi, Efficient Unification with Infinite Terms in Logic Programming, Proc. Fifth Generation Computer Systems, pp. 202\u2013209, 1984."},{"key":"19_CR13","unstructured":"http:\/\/www.cs.info.mie-u.ac.jp\/~mo\/rta01\/ ."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45127-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:57:55Z","timestamp":1737287875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45127-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421177","9783540451273"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45127-7_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}