{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:38:52Z","timestamp":1725536332306},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035630"},{"type":"electronic","value":"9783642035647"}],"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-03564-7_7","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T03:05:35Z","timestamp":1250737535000},"page":"123-135","source":"Crossref","is-referenced-by-count":1,"title":["Canonical Reduction Systems in Symbolic Mathematics"],"prefix":"10.1007","author":[{"given":"Franz","family":"Winkler","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-79351-6","volume-title":"Reduktionssysteme","author":"J. Avenhaus","year":"1995","unstructured":"Avenhaus, J.: Reduktionssysteme. Springer, Heidelberg (1995)"},{"key":"7_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-Rewriting Systems","author":"R.V. Book","year":"1993","unstructured":"Book, R.V., Otto, R.: String-Rewriting Systems. Springer, Heidelberg (1993)"},{"key":"7_CR3","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D.E. Knuth","year":"1970","unstructured":"Knuth, D.E., Bendix, P.B.: Simple Word Problems in Universal Algebra. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon Press, Oxford (1970)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Winkler, F.: The Church\u2013Rosser property in computer algebra and special theorem proving: An investigation of critical\u2013pair\/completion algorithms, Dissertation Univ. Linz, Austria, VWG\u00d6 Wien (1984)","DOI":"10.1145\/1089389.1089396"},{"key":"7_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6571-3","volume-title":"Polynomial Algorithms in Computer Algebra","author":"F. Winkler","year":"1996","unstructured":"Winkler, F.: Polynomial Algorithms in Computer Algebra. Springer, Wien New York (1996)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03564-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:52:23Z","timestamp":1558479143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03564-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035630","9783642035647"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03564-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}