{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:44:16Z","timestamp":1725576256281},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232124"},{"type":"electronic","value":"9783540302100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30210-0_10","type":"book-chapter","created":{"date-parts":[[2011,1,18]],"date-time":"2011-01-18T10:34:36Z","timestamp":1295346876000},"page":"103-117","source":"Crossref","is-referenced-by-count":1,"title":["On the Combination of Congruence Closure and Completion"],"prefix":"10.1007","author":[{"given":"Christelle","family":"Scharff","sequence":"first","affiliation":[]},{"given":"Leo","family":"Bachmair","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term rewriting and all that","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, Cambridge (1998)"},{"key":"10_CR2","series-title":"Lecture Notes in Artificial Intelligence","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.V., Tiwari, A., Vigneron, L.: Congruence Closure Modulo Associativity and Commutativity. In: Kirchner, H. (ed.) FroCos 2000. LNCS (LNAI), vol.\u00a01794, pp. 245\u2013259. Springer, Heidelberg (2000)"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/B:JARS.0000009518.26415.49","volume":"31","author":"L. Bachmair","year":"2003","unstructured":"Bachmair, L., Tiwari, A., Vigneron, L.: Abstract congruence closure. J. of Automated Reasoning\u00a031(2), 129\u2013168 (2003)","journal-title":"J. of Automated Reasoning"},{"key":"10_CR4","first-page":"244","volume-title":"Handbook of Theoretical Computer Science: Rewrite Systems","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Handbook of Theoretical Computer Science: Rewrite Systems, vol.\u00a0B, pp. 244\u2013320. Elsevier Science Publishers, Amsterdam (1990)"},{"issue":"4","key":"10_CR5","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 subexpression problem. Journal of the ACM\u00a027(4), 758\u2013771 (1980)","journal-title":"Journal of the ACM"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","author":"D.L. Kapur","year":"1997","unstructured":"Kapur, D.L.: Shostak\u2019s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, Springer, Heidelberg (1997)"},{"key":"10_CR7","series-title":"Computational Problems in Abstract Algebra","first-page":"263","volume-title":"Simple word problems in universal algebras","author":"D.E. Knuth","year":"1970","unstructured":"Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon Press, Oxford (1970)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Complexity of Finitely Presented Algebras. PhD. thesis. Cornell University (1977)","DOI":"10.1145\/800105.803406"},{"issue":"1","key":"10_CR9","first-page":"1","volume":"2","author":"C. Lynch","year":"1998","unstructured":"Lynch, C., Strogova, P.: SOUR graphs for efficient completion. Journal of Discrete Mathematics and Theoretical Computer Science\u00a02(1), 1\u201325 (1998)","journal-title":"Journal of Discrete Mathematics and Theoretical Computer Science"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"C.G. Nelson","year":"1980","unstructured":"Nelson, C.G., Oppen, D.C.: Fast Decision Procedures based on Congruence Closure. Journal of the ACM\u00a027(2), 356\u2013364 (1980)","journal-title":"Journal of the ACM"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1996.0028","volume":"125","author":"D.A. Plaisted","year":"1996","unstructured":"Plaisted, D.A., Sattler-Klein, A.: Proof lengths for equational completion. Journal of Inf. Comput\u00a0125(2), 154\u2013170 (1996)","journal-title":"Journal of Inf. Comput"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2422.322411","volume":"31","author":"R.E. Shostak","year":"1984","unstructured":"Shostak, R.E.: Deciding Combinations of Theories. Journal of the ACM\u00a031, 1\u201312 (1984)","journal-title":"Journal of the ACM"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1006\/jsco.1993.1029","volume":"15","author":"W. Snyder","year":"1993","unstructured":"Snyder, W.: A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations. Journal of Symbolic Computation\u00a015, 415\u2013450 (1993)","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30210-0_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:49:25Z","timestamp":1605761365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30210-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232124","9783540302100"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30210-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}