{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:45Z","timestamp":1749124065711},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676645"},{"type":"electronic","value":"9783540451013"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721959_5","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T16:12:31Z","timestamp":1167408751000},"page":"64-78","source":"Crossref","is-referenced-by-count":23,"title":["Abstract Congruence Closure and Specializations"],"prefix":"10.1007","author":[{"given":"Leo","family":"Bachmair","sequence":"first","affiliation":[]},{"given":"Ashish","family":"Tiwari","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/174652.174655","volume":"41","author":"L. Bachmair","year":"1994","unstructured":"Bachmair, L., Dershowitz, N.: Equational inference, canonical proofs, and proof orderings. J. ACM\u00a041, 236\u2013276 (1994)","journal-title":"J. ACM"},{"key":"5_CR2","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":"5_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/10720084_16","volume-title":"Frontiers of Combining Systems","author":"L. Bachmair","year":"2000","unstructured":"Bachmair, L., Ramakrishnan, I., Tiwari, A., Vigneron, L.: Congruence closure modulo associativity and commutativity. In: Kirchner, H., Ringeissen, C. (eds.) FroCos 2000. LNCS (LNAI), vol.\u00a01794, pp. 245\u2013259. Springer, Heidelberg (2000)"},{"key":"5_CR4","unstructured":"Chew, L.P.: Normal forms in term rewriting systems. PhD thesis. Purdue University (1981)"},{"key":"5_CR5","unstructured":"Clavel, M., et al.: Maude: Specification and Programming in Rewriting Logic. SRI International, Menlo Park, CA (1999), \n                    \n                      http:\/\/maude.csl.sri.com\/manual\/"},{"key":"5_CR6","series-title":"Formal Models and Semantics","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. Formal Models and Semantics, vol. B, North-Holland, Amsterdam (1990)"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"P.J. Downey","year":"1980","unstructured":"Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpressions problem. J. ACM\u00a027(4), 758\u2013771 (1980)","journal-title":"J. ACM"},{"key":"5_CR8","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)"},{"issue":"2","key":"5_CR9","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 of the Association for Computing Machinery\u00a027(2), 356\u2013364 (1980)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1996.0028","volume":"125","author":"D. Plaisted","year":"1996","unstructured":"Plaisted, D., Sattler-Klein, A.: Proof lengths for equational completion. Information and Computation\u00a0125, 154\u2013170 (1996)","journal-title":"Information and Computation"},{"issue":"7","key":"5_CR11","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/359545.359570","volume":"21","author":"R.E. Shostak","year":"1984","unstructured":"Shostak, R.E.: Deciding combinations of theories. Journal of the ACM\u00a021(7), 583\u2013585 (1984)","journal-title":"Journal of the ACM"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Snyder, W.: A fast algorithm for generating reduced ground rewriting systems from a set of ground equations. Journal of Symbolic Computation\u00a015(7) (1993)","DOI":"10.1006\/jsco.1993.1029"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Tiwari, A., Bachmair, L., Ruess, H.: Rigid E-unification revisited. In: McAllester, D. (ed.) 17th Intl Conf. on Automated Deduction, CADE-17 (2000)","DOI":"10.1007\/10721959_17"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction - CADE-17"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721959_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T05:52:21Z","timestamp":1553320341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721959_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676645","9783540451013"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/10721959_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}