{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:34Z","timestamp":1725565414562},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_20","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"285-300","source":"Crossref","is-referenced-by-count":3,"title":["The Joinability and Unification Problems for Confluent Semi-constructor TRSs"],"prefix":"10.1007","author":[{"given":"Ichiro","family":"Mitsuhashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michio","family":"Oyamaguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshikatsu","family":"Ohta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyuki","family":"Yamada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_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)"},{"issue":"1","key":"20_CR2","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, cycle-syntacticness and shallow theories. Information and Computation\u00a0111(1), 154\u2013191 (1994)","journal-title":"Information and Computation"},{"issue":"4","key":"20_CR3","first-page":"992","volume":"39","author":"H. Gomi","year":"1998","unstructured":"Gomi, H., Oyamaguchi, M., Ohta, Y.: On the Church-Rosser property of root- E-overlapping and strongly depth-preserving term rewriting systems. Transactions of Information Processing Society of Japan\u00a039(4), 992\u20131005 (1998)","journal-title":"Transactions of Information Processing Society of Japan"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"5th Conference on Automated Deduction","author":"J.-M. Hullot","year":"1980","unstructured":"Hullot, J.-M.: Canonical forms and unification. In: Bibel, W. (ed.) CADE 1980. LNCS, vol.\u00a087, pp. 318\u2013334. Springer, Heidelberg (1980)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0052362","volume-title":"Rewriting Techniques and Applications","author":"F. Jacquemard","year":"1998","unstructured":"Jacquemard, F., Meyer, C., Weidenbach, C.: Unification in extensions of shallow equational theories. In: Nipkow, T. (ed.) RTA 1998. LNCS, vol.\u00a01379, pp. 76\u201390. Springer, Heidelberg (1998)"},{"key":"20_CR6","unstructured":"Martelli, A., Rossi, G.: Efficient unification with infinite terms in logic programming. In: Proc. 5th Generation Computer Systems, pp. 202\u2013209 (1984)"},{"issue":"SIG 4(PRO 17","key":"20_CR7","first-page":"54","volume":"44","author":"I. Mitsuhashi","year":"2003","unstructured":"Mitsuhashi, I., Oyamaguchi, M., Ohta, Y., Yamada, T.: On the unification problem for confluent monadic term rewriting systems. IPSJ Transactions on Programming\u00a044(SIG 4(PRO 17), 54\u201366 (2003)","journal-title":"IPSJ Transactions on Programming"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R.: Basic paramodulation and decidable theories. In: Proc. 11th IEEE Symp. Logic in Computer Science, pp. 473\u2013482 (1996)","DOI":"10.1109\/LICS.1996.561464"},{"issue":"5","key":"20_CR9","first-page":"718","volume":"E73","author":"M. Oyamaguchi","year":"1990","unstructured":"Oyamaguchi, M.: On the word problem for right-ground term-rewriting systems. Trans. IEICE\u00a0E73(5), 718\u2013723 (1990)","journal-title":"Trans. IEICE"},{"issue":"3","key":"20_CR10","first-page":"347","volume":"13","author":"M. Oyamaguchi","year":"1990","unstructured":"Oyamaguchi, M.: The reachability and joinability problems for right-ground termrewriting systems. Journal of Information Processing\u00a013(3), 347\u2013354 (1990)","journal-title":"Journal of Information Processing"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0890-5401(03)00022-1","volume":"183","author":"M. Oyamaguchi","year":"2003","unstructured":"Oyamaguchi, M., Ohta, Y.: The unification problem for confluent right-ground term rewriting systems. Information and Computation\u00a0183(2), 187\u2013211 (2003)","journal-title":"Information and Computation"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-0000(88)90014-1","volume":"37","author":"K. Salomaa","year":"1988","unstructured":"Salomaa, K.: Deterministic tree pushdown automata and monadic tree rewriting systems. Jornal of Computer and System Sciences\u00a037, 367\u2013394 (1988)","journal-title":"Jornal of Computer and System Sciences"},{"key":"20_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)"},{"key":"20_CR14","unstructured":"Terese.: Term Rewriting Systems, Cambridge University Press, Cambridge (2003)"},{"key":"20_CR15","unstructured":"http:\/\/www.cs.info.mie-u.ac.jp\/~ichiro\/rta04\/"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T09:37:43Z","timestamp":1553074663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}