{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:44Z","timestamp":1725664784993},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_56","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:40:15Z","timestamp":1330292415000},"page":"245-259","source":"Crossref","is-referenced-by-count":1,"title":["Confluence of terminating conditional rewrite systems revisited"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Gramlich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claus-Peter","family":"Wirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"J. Avenhaus and C. Lor\u00eda-S\u00e1enz. On conditional rewrite systems with extra variables and deterministic logic programs. In F. Pfenning, ed., Proc. 5th LPAR, LNAI 822, pp. 215\u2013229, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58216-9_40"},{"issue":"1","key":"19_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0747-7171(88)80018-X","volume":"6","author":"L. Bachmair","year":"1988","unstructured":"L. Bachmair and N. Dershowitz. Critical pair criteria for completion. Journal of Symbolic Computation, 6(1):1\u201318, 1988.","journal-title":"Journal of Symbolic Computation"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","volume":"32","author":"J. Bergstra","year":"1986","unstructured":"J. Bergstra and J. Klop. Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences, 32:323\u2013362, 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, ed., Formal models and semantics, Handbook of Theoretical Computer Science, vol. B, ch. 6, pp. 243\u2013320. Elsevier-The MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"19_CR5","unstructured":"N. Dershowitz, M. Okada, and G. Sivakumar. Confluence of conditional rewrite systems. In S. Kaplan and J.-P. Jouannaud, eds., Proc. 1st CTRS (1987), LNCS 308, pp. 31\u201344, Springer-Verlag, 1988."},{"key":"19_CR6","unstructured":"B. Gramlich. On termination and confluence of conditional rewrite systems. In N. Dershowitz and N. Lindenstrauss, eds., Proc. 4th CTRS (1994), LNCS 968, pp. 166\u2013185. Springer-Verlag, 1995."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"B. Gramlich. Confluence without termination via parallel critical pairs. In H. Kirchner, ed., Proc. 21st CAAP, LNCS 1059, pp. 211\u2013225. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61064-2_39"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(84)90087-2","volume":"33","author":"S. Kaplan","year":"1984","unstructured":"S. Kaplan. Conditional rewrite rules. TCS, 33:175\u2013193, 1984.","journal-title":"TCS"},{"issue":"6","key":"19_CR9","first-page":"19","volume":"1988","author":"D. Kapur","year":"1988","unstructured":"D. Kapur, D. Musser, and P. Narendran. Only prime superpositions need be considered in the Knuth-Bendix completion procedure. JSC, 1988(6):19\u201336, 1988.","journal-title":"JSC"},{"key":"19_CR10","first-page":"2","volume-title":"Handbook of Logic in Computer Science, vol. 2","author":"J. W. Klop","year":"1992","unstructured":"J. W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, eds., Handbook of Logic in Computer Science, vol. 2, ch. 1, pp. 2\u2013117. Clarendon Press, Oxford, 1992."},{"key":"19_CR11","series-title":"LNCS 914","first-page":"179","volume-title":"Proc. 6th RTA","author":"T. Suzuki","year":"1995","unstructured":"T. Suzuki, A. Middeldorp, and T. Ida. Level-confluence of conditional rewrite systems with extra variables in right-hand sides. In J. Hsiang, ed., Proc. 6th RTA, LNCS 914, pp. 179\u2013193, Kaiserslautern, Springer-Verlag, 1995."},{"key":"19_CR12","unstructured":"C.-P. Wirth. Syntactic confluence criteria for constructor-based positive\/negativeconditional term rewriting systems. SEKI-Report SR-95-09, Fachbereich Informatik, Universit\u00e4t Kaiserslautern, 1995."},{"key":"19_CR13","first-page":"51","volume":"17","author":"C.-P. Wirth","year":"1994","unstructured":"C.-P. Wirth and B. Gramlich. A constructor-based approach for positive\/negative conditional equational specifications. JSC, 17:51\u201390, 1994.","journal-title":"JSC"}],"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-61464-8_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:29Z","timestamp":1605647189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}