{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:16:31Z","timestamp":1753888591414,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_18","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"212-222","source":"Crossref","is-referenced-by-count":6,"title":["Diagrammatic Confluence and Completion"],"prefix":"10.1007","author":[{"given":"Jean-Pierre","family":"Jouannaud","sequence":"first","affiliation":[]},{"given":"Vincent","family":"van Oostrom","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Bachmair, L., Dershowitz, N., Hsiang, J.: Orderings for equational proofs. In: Proc. 1st IEEE Symp. Logic in Computer Science, Camb., Mass., June 1986, pp. 346\u2013357 (1986)"},{"key":"18_CR2","series-title":"Rewriting Techniques","first-page":"1","volume-title":"Resolution of Equations in Algebraic Structures","author":"L. Bachmair","year":"1989","unstructured":"Bachmair, L., Dershowitz, N., Plaisted, D.A.: Completion without failure. In: Kaci, A.H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures. Rewriting Techniques, vol.\u00a02, pp. 1\u201330. Academic Press, New York (1989)"},{"key":"18_CR3","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 243\u2013309. North-Holland, Amsterdam (1990)"},{"key":"18_CR4","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term rewriting systems","author":"J.W. Klop","year":"2003","unstructured":"Klop, J.W., et al.: Term rewriting systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-18088-5_6","volume-title":"14th International Colloquium on Automata, languages and programming","author":"J. Hsiang","year":"1987","unstructured":"Hsiang, J., Rusinowitch, M.: On word problems in equational theories. In: 14th International Colloquium on Automata, languages and programming, London, UK, pp. 54\u201371. Springer, London (1987)"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. Journal of the ACM\u00a027(4), 797\u2013821 (1980)","journal-title":"Journal of the ACM"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0022-0000(81)90002-7","volume":"23","author":"G. Huet","year":"1981","unstructured":"Huet, G.: A complete proof of correctness of the Knuth-Bendix completion algorithm. Journal of Computer and System Sciences\u00a023, 11\u201321 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR8","unstructured":"Jouannaud, J.-P.: Church-Rosser properties of normal rewriting, draft (2009)"},{"issue":"4","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"Jouannaud, J.-P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM Journal on Computing\u00a015(4), 1155\u20131194 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"Newman, M.H.A.: On theories with a combinatorial definition of \u2018equivalence\u2019. Ann. Math.\u00a043(2), 223\u2013243 (1942)","journal-title":"Ann. Math."},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"K.R. Barry","year":"1973","unstructured":"Barry, K.R.: Tree-manipulating systems and Church-Rosser theorems. J. of the Association for Computing Machinery\u00a020(1), 160\u2013187 (1973)","journal-title":"J. of the Association for Computing Machinery"},{"key":"18_CR12","unstructured":"van Oostrom, V.: Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam (1994)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-70590-1_21","volume-title":"Rewriting Techniques and Applications","author":"V. Oostrom van","year":"2008","unstructured":"van Oostrom, V.: Confluence by decreasing diagrams. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 306\u2013320. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T20:28:10Z","timestamp":1552076890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}