{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:33Z","timestamp":1725663513190},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:08:11Z","timestamp":1330254491000},"page":"378-392","source":"Crossref","is-referenced-by-count":4,"title":["Confluence of terminating membership conditional TRS"],"prefix":"10.1007","author":[{"given":"Junnosuke","family":"Yamada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","volume":"32","author":"J. Bergstra","year":"1986","unstructured":"Bergstra, J. and Klop, J.: \u201cConditional Rewrite Rules\u201d, J. of Comp. and Sys. Sci. 32, pp.323\u2013362 (1986).","journal-title":"J. of Comp. and Sys. Sci."},{"key":"29_CR2","first-page":"674","volume":"443","author":"H. Comon","year":"1990","unstructured":"Comon, H.: \u201cEquational Formulas in Order Sorted Formulas\u201d, Springer LNCS 443, pp.674\u2013688 (1990).","journal-title":"Springer LNCS"},{"key":"29_CR3","first-page":"392","volume":"623","author":"H. Comon","year":"1992","unstructured":"Comon, H.: \u201cCompletion of Rewrite Systems with Membership Conditions\u201d, Springer LNCS 623, pp.392\u2013404 (1992).Draft for full version, May 1992.","journal-title":"Springer LNCS"},{"key":"29_CR4","unstructured":"Dershowitz, N. and Jouannaud, J.-P.: \u201cRewrite Systems\u201d, in Handbook of Theoretical Computer Science, Vol.B, N.-Holland (1990)."},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(90)90034-F","volume":"72","author":"I. Gnaedig","year":"1990","unstructured":"Gnaedig, I., Kirchner, C. and Kirchner, H.: \u201cEquational Completion in Order Sorted Algebras\u201d, TCS 72, pp. 169\u2013202 (1990).","journal-title":"TCS"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: \u201cConfluent Reductions: Abstract Properties and Applications to Term Rewriting Systems\u201d, J. of ACM 27, pp.797\u2013821 (1980).","journal-title":"J. of ACM"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0022-0000(82)90006-X","volume":"25","author":"G. Huet","year":"1982","unstructured":"Huet, G. and Hullot, J.-M.: \u201cInduction in Equational Theories with Constructors\u201d, J. of Comp. and Sys. Sci. 25, pp.239\u2013266 (1982).","journal-title":"J. of Comp. and Sys. Sci."},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0747-7171(87)80010-X","volume":"4","author":"S. Kaplan","year":"1987","unstructured":"Kaplan, S.: \u201cSimplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence\u201d, J. of Symbolic Computation 4, pp.295\u2013334 (1987).","journal-title":"J. of Symbolic Computation"},{"key":"29_CR9","first-page":"99","volume":"230","author":"D. Kapur","year":"1985","unstructured":"Kapur, D., Narendran, P. and Zhang, H.: \u201cProof by Induction Using Test Sets\u201d, Springer LNCS 230, pp.99\u2013117 (1985).","journal-title":"Springer LNCS"},{"key":"29_CR10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(89)90007-8","volume":"67","author":"H. Kirchner","year":"1989","unstructured":"Kirchner, H.: \u201cSchematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes\u201d, TCS 67, pp.303\u2013332 (1989).","journal-title":"TCS"},{"key":"29_CR11","first-page":"143","volume":"516","author":"H. Kirchner","year":"1991","unstructured":"Kirchner H. and Hermann, M.: \u201cMeta-rule Synthesis from Crossed Rewrite Systems\u201d, Springer LNCS 516, pp.143\u2013154 (1991).","journal-title":"Springer LNCS"},{"key":"29_CR12","unstructured":"Knuth, E. and Bendix, B.: \u201cSimple Word Problems in Universal Algebras\u201d, in Computational Problems in Abstract Algebra, ed. J. Leech, pp.263\u2013297, Pergamon Press (1970)."},{"key":"29_CR13","unstructured":"Nutt, W., Smolka, G., Goguen, J., and Meseguer, J.: \u201cOrder Sorted Computation\u201d, Proc. the Colloq. on Resolution of Equations in Algebraic Structures (1987)."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Thiel, J.-J.: \u201cStop Losing Sleep over Incomplete Data Type Specification\u201d, Proc. 11th ACM POPL, pp.76\u201382 (1984).","DOI":"10.1145\/800017.800518"},{"key":"29_CR15","first-page":"228","volume":"308","author":"Y. Toyama","year":"1988","unstructured":"Toyama, Y.: \u201cTerm Rewriting Systems with Membership Conditions\u201d, Springer LNCS 308, pp.228\u2013244 (1988).","journal-title":"Springer LNCS"},{"key":"29_CR16","first-page":"1224","volume":"E72","author":"Y. Toyama","year":"1989","unstructured":"Toyama, Y.: \u201cMembership Conditional Term Rewriting Systems\u201d, Trans. IEICEJ, E72, pp.1224\u20131229 (1989).","journal-title":"Trans. IEICEJ"},{"key":"29_CR17","first-page":"369","volume":"90","author":"Y. Toyama","year":"1991","unstructured":"Toyama, Y.: \u201cHow to Prove Equivalence of Term Rewriting Systems without Induction\u201d, TCS 90(1991), pp. 369\u2013390.","journal-title":"TCS"},{"key":"29_CR18","unstructured":"Yamada, J.: \u201cMembership Conditional TRS with Infinite Sets in Conditions\u201d, IPSJ SIG Notes 90-SF-35-6\/IEICEJ Tech. Rep. COMP90-6 (1990)."},{"key":"29_CR19","first-page":"666","volume":"J-74-D-I","author":"J. Yamada","year":"1991","unstructured":"Yamada, J.: \u201cOn the Confluence of Terminating Membership Conditional TRS\u201d, IEICEJ Trans. IEICEJ J-74-D-I (1991), pp.666\u2013674, in Japanese.","journal-title":"IEICEJ Trans. IEICEJ"},{"key":"29_CR20","unstructured":"Yamada, J.: \u201cMembership Conditional TRS with Regular Tree Automata\u201d, ICOT PAR-WG, Feb. 1992."},{"key":"29_CR21","unstructured":"Yamada, J. and Toyama, Y.: \u201cConfluence of Membership Conditional TRS\u201d, IEICEJ Tech. Rep. COMP89-8\/IPSJ SIG Notes 89-SF-28-8 (1989)."},{"key":"29_CR22","first-page":"46","volume":"202","author":"H. Zhang","year":"1985","unstructured":"Zhang, H. and R\u00e9my, J.-L.: \u201cContextual Rewriting\u201d, Springer LNCS 202, pp.46\u201362 (1985).","journal-title":"Springer LNCS"}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:23Z","timestamp":1619571023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}