{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:46:55Z","timestamp":1725475615829},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672814"},{"type":"electronic","value":"9783540464211"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720084_16","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T09:36:30Z","timestamp":1167384990000},"page":"245-259","source":"Crossref","is-referenced-by-count":14,"title":["Congruence Closure Modulo Associativity and Commutativity"],"prefix":"10.1007","author":[{"given":"L.","family":"Bachmair","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. V.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Tiwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Bachmair, L.: Canonical Equational Proofs. Birkh\u00e4user, Boston (1991)","DOI":"10.1007\/978-1-4684-7118-2"},{"issue":"2 & 3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(89)90003-0","volume":"67","author":"L. Bachmair","year":"1989","unstructured":"Bachmair, L., Dershowitz, N.: Completion for rewriting modulo a congruence. Theoretical Computer Science\u00a067(2 & 3), 173\u2013201 (1989)","journal-title":"Theoretical Computer Science"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-48685-2_15","volume-title":"Rewriting Techniques and Applications","author":"L. Bachmair","year":"1999","unstructured":"Bachmair, L., Ramakrishnan, C., Ramakrishnan, I., Tiwari, A.: Normalization via rewrite closures. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, pp. 190\u2013204. Springer, Heidelberg (1999)"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0898-1221(81)90115-2","volume":"7","author":"A.M. Ballantyne","year":"1981","unstructured":"Ballantyne, A.M., Lankford, D.S.: New decision algorithms for finitely presented commutative semigroups. Comp. and Maths. with Appls.\u00a07, 159\u2013165 (1981)","journal-title":"Comp. and Maths. with Appls."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner bases: a computational approach to commutative algebra. Springer, Berlin (1993)","DOI":"10.1007\/978-1-4612-0913-3"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B. North-Holland, Amsterdam (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"issue":"8","key":"16_CR7","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Communications of the ACM\u00a022(8), 465\u2013476 (1979)","journal-title":"Communications of the ACM"},{"key":"16_CR8","unstructured":"Domenjoud, E., Klay, F.: Shallow AC theories. In: Proceedings of the 2nd CCL Workshop, La Escala, Spain (September 1993)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/3-540-62950-5_59","volume-title":"Rewriting Techniques and Applications","author":"D. Kapur","year":"1997","unstructured":"Kapur, D.: Shostak\u2019s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, pp. 23\u201337. Springer, Heidelberg (1997)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Koppenhagen, U., Mayr, E.W.: An optimal algorithm for constructing the reduced Gr\u00f6bner basis of binomial ideals. In: Lakshman, Y.D. (ed.) Proceedings of the International Symposium on Symbolic and Algebraic Computation, pp. 55\u201362 (1996)","DOI":"10.1145\/236869.236899"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-53904-2_114","volume-title":"Rewriting Techniques and Applications","author":"C. Marche","year":"1991","unstructured":"Marche, C.: On ground AC-completion. In: Book, R.V. (ed.) RTA 1991. LNCS, vol.\u00a0488, pp. 411\u2013422. Springer, Heidelberg (1991)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E.W. Mayr","year":"1982","unstructured":"Mayr, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics\u00a046, 305\u2013329 (1982)","journal-title":"Advances in Mathematics"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/3-540-53904-2_115","volume-title":"Rewriting Techniques and Applications","author":"P. Narendran","year":"1991","unstructured":"Narendran, P., Rusinowitch, M.: Any ground associative-commutative theory has a finite canonical system. In: Book, R.V. (ed.) RTA 1991. LNCS, vol.\u00a0488, pp. 423\u2013434. Springer, Heidelberg (1991)"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"16_CR15","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"Nelson, G., Oppen, D.: Fast decision procedures based on congruence closure. Journal ofthe Association for Computing Machinery\u00a027(2), 356\u2013364 (1980)","journal-title":"Journal ofthe Association for Computing Machinery"},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G.E. Peterson","year":"1981","unstructured":"Peterson, G.E., Stickel, M.E.: Complete sets of reductions for some equational theories. J. ACM\u00a028(2), 233\u2013264 (1981)","journal-title":"J. ACM"},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-94-009-0349-4_6","volume-title":"Frontiers of Combining Systems","author":"C. Ringeissen","year":"1996","unstructured":"Ringeissen, C.: Cooperation of decision procedures for the satisfiability problem. In: Baader, F., Schulz, K.U. (eds.) Frontiers of Combining Systems, pp. 121\u2013139. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/3-540-56868-9_28","volume-title":"Proceedings of the 5 Intl. Conference on Rewriting Techniques and Applications","author":"A. Rubio","year":"1993","unstructured":"Rubio, A., Nieuwenhuis, R.: A precedence-based total AC-compatible ordering. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol.\u00a0690, pp. 374\u2013388. Springer, Heidelberg (1993)"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-94-009-0349-4_5","volume-title":"Frontiers of Combining Systems","author":"C. Tinelli","year":"1996","unstructured":"Tinelli, C., Harandi, M.: A new correctness proof of the Nelson-Oppen combination procedure. In: Baader, F., Schulz, K.U. (eds.) Frontiers of Combining Systems, pp. 103\u2013119. Kluwer Academic Publishers, Dordrecht (1996)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720084_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T07:34:31Z","timestamp":1556004871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720084_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672814","9783540464211"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/10720084_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}