{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:29:32Z","timestamp":1753885772965},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70590-1_21","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"306-320","source":"Crossref","is-referenced-by-count":18,"title":["Confluence by Decreasing Diagrams"],"prefix":"10.1007","author":[{"given":"Vincent","family":"van Oostrom","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"van Oostrom, V.: Confluence for Abstract and Higher-Order Rewriting. PhD thesis. Vrije Universiteit, Amsterdam (March 1994)"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0304-3975(92)00023-K","volume":"126","author":"V. Oostrom van","year":"1994","unstructured":"van Oostrom, V.: Confluence by decreasing diagrams. Theoretical Computer Science\u00a0126(2), 259\u2013280 (1994)","journal-title":"Theoretical Computer Science"},{"key":"21_CR3","series-title":"Colloquia Mathematica Societatis J\u00e1nos Bolyai, 42","volume-title":"Algebra, Combinatorics and Logic in Computer Science","author":"F. Winkler","year":"1983","unstructured":"Winkler, F., Buchberger, B.: A criterion for eliminating unnecessary reductions in the Knuth\u2013Bendix algorithm. In: Algebra, Combinatorics and Logic in Computer Science, Gy\u00f6r (Hungary) (1983) Colloquia Mathematica Societatis J\u00e1nos Bolyai, 42, vol.\u00a0II, North-Holland, Amsterdam (1986)"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M. Newman","year":"1942","unstructured":"Newman, M.: On theories with a combinatorial definition of \u201cequivalence\u201d. Annals of Mathematics\u00a043(2), 223\u2013243 (1942)","journal-title":"Annals of Mathematics"},{"key":"21_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced Topics in Term Rewriting","author":"E. Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)"},{"key":"21_CR6","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese,: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press, Cambridge (2003)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-540-73449-9_24","volume-title":"Term Rewriting and Applications","author":"V. Oostrom van","year":"2007","unstructured":"van Oostrom, V.: Random descent. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 314\u2013328. Springer, Heidelberg (2007)"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/inco.1997.2683","volume":"141","author":"M. Bezem","year":"1998","unstructured":"Bezem, M., Klop, J., van Oostrom, V.: Diagram techniques for confluence. Information and Computation\u00a0141(2), 172\u2013204 (1998)","journal-title":"Information and Computation"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1093\/logcom\/10.3.437","volume":"10","author":"J. Klop","year":"2000","unstructured":"Klop, J., van Oostrom, V., de Vrijer, R.: A geometric proof of confluence by decreasing diagrams. Journal of Logic and Computation\u00a010(3), 437\u2013460 (2000)","journal-title":"Journal of Logic and Computation"},{"key":"21_CR10","unstructured":"Geser, A.: Relative Termination. PhD thesis, Universit\u00e4t Passau (1990)"},{"key":"21_CR11","unstructured":"Klop, J.: Term rewriting systems. In: Handbook of Logic in Computer Science. Background: Computational Structures, vol.\u00a02, pp. 1\u2013116. Oxford Science Publications (1992)"},{"issue":"1-2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.tcs.2007.02.060","volume":"380","author":"D. Pous","year":"2007","unstructured":"Pous, D.: New up-to techniques for weak bisimulation. Theoretical Computer Science\u00a0380(1-2), 164\u2013180 (2007)","journal-title":"Theoretical Computer Science"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11805618_6","volume-title":"Term Rewriting and Applications","author":"B. Gramlich","year":"2006","unstructured":"Gramlich, B., Lucas, S.: Generalizing Newman\u2019s lemma for left-linear rewrite systems. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 66\u201380. Springer, Heidelberg (2006)"},{"key":"21_CR14","series-title":"Progress in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-8442-6","volume-title":"Braids and Self-Distributivity","author":"P. Dehornoy","year":"2000","unstructured":"Dehornoy, P.: Braids and Self-Distributivity. Progress in Mathematics, vol.\u00a0192. Birkh\u00e4user, Basel (2000)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:38:23Z","timestamp":1578526703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_21"}},"subtitle":["Converted"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705888","9783540705901"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}