{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:42Z","timestamp":1725663462806},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540510819"},{"type":"electronic","value":"9783540461494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51081-8_98","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:38:02Z","timestamp":1330202282000},"page":"29-44","source":"Crossref","is-referenced-by-count":10,"title":["Complete sets of reductions modulo associativity, commutativity and identity"],"prefix":"10.1007","author":[{"given":"Timothy B.","family":"Baird","sequence":"first","affiliation":[]},{"given":"Gerald E","family":"Peterson","sequence":"additional","affiliation":[]},{"given":"Ralph W.","family":"Wilkerson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-17220-3_17","volume":"256","author":"L. Bachmair","year":"1987","unstructured":"L. Bachmair and N. Dershowitz, \u201cCompletion for rewriting modulo a congruence,\u201d Rewriting Techniques and Applications, Lecture Notes in Computer Science\n256, Springer-Verlag (1987), pp. 192\u2013203.","journal-title":"Rewriting Techniques and Applications, Lecture Notes in Computer Science"},{"key":"4_CR2","volume-title":"Complete sets of reductions modulo a class of equational theories which generate infinite congruence classes","author":"T. Baird","year":"1988","unstructured":"T. Baird, \u201cComplete sets of reductions modulo a class of equational theories which generate infinite congruence classes,\u201d Ph.D. Dissertation, University of Missouri\u2014Rolla, Rolla, MO, (1988)."},{"key":"4_CR3","series-title":"Technical Report","volume-title":"A term rewriting system generator with failure-resistant Knuth-Bendix","author":"R. Forgaard","year":"1984","unstructured":"R. Forgaard and J. V. Guttag, \u201cA term rewriting system generator with failure-resistant Knuth-Bendix,\" Technical Report, MIT Laboratory for Computer Science, Massachussets Institute of Technology, Cambridge, MA (1984)."},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.-P. Jouannaud","year":"1986","unstructured":"J.-P. Jouannaud and H. Kirchner, \u201cCompletion of a set of rules modulo a set of equations,\u201d SIAM Journal of Computing, 15 (1986), pp. 1155\u20131194.","journal-title":"SIAM Journal of Computing"},{"key":"4_CR5","first-page":"263","volume-title":"Computational Problems in Abstract Algebras","author":"D. Knuth","year":"1970","unstructured":"D. Knuth and P. Bendix, \u201cSimple word problems in universal algebras,\u201d Computational Problems in Abstract Algebras, J. Leech, ed., Pergamon Press, Oxford, England, (1970), pp. 263\u2013297."},{"key":"4_CR6","volume-title":"Decision procedures for simple equational theories with commutative-associative axioms: complete sets of commutative-associative reductions","author":"D. Lankford","year":"1977","unstructured":"D. Lankford and A. Ballantyne, \u201cDecision procedures for simple equational theories with commutative-associative axioms: complete sets of commutative-associative reductions,\u201d Memo ATP-39, Dept. of Mathematics and Computer Science, University of Texas, Austin, Texas (1977)."},{"key":"4_CR7","volume-title":"The role of term symmetry in equational unification and completion procedures","author":"B. Mayfield","year":"1988","unstructured":"B. Mayfield, \u201cThe role of term symmetry in equational unification and completion procedures,\u201d, Ph.D. Dissertation, University of Missouri\u2014Rolla, Rolla, MO, 1988."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G. Peterson","year":"1981","unstructured":"G. Peterson and M. Stickel, \u201cComplete sets of reductions for some equational theories,\u201d J. ACM, 28 (1981), pp. 233\u2013264.","journal-title":"J. ACM"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","volume":"28","author":"M. Stickel","year":"1981","unstructured":"M. Stickel, \u201cA unification algorithm for associative-commutative functions,\u201d J. ACM, 28 (1981), pp. 423\u2013434.","journal-title":"J. ACM"}],"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-51081-8_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:00:28Z","timestamp":1619571628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51081-8_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510819","9783540461494"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-51081-8_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}