Abstract
We present a graph-based method for constructing a congruence closure of a given set of ground equalities that combines the key ideas of two well-known approaches, completion and abstract congruence closure, in a natural way by relying on a specialized and optimized version of the more general, but less efficient, SOUR graphs. This approach allows for efficient implementations and a visual presentation that better illuminates the basic ideas underlying the construction of congruence closures and clarifies the role of original and extended signatures and the impact of rewrite techniques for ordering equalities.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, Cambridge (1998)
Bachmair, L., Ramakrishnan, I.V., Tiwari, A., Vigneron, L.: Congruence Closure Modulo Associativity and Commutativity. In: Kirchner, H. (ed.) FroCos 2000. LNCS (LNAI), vol. 1794, pp. 245–259. Springer, Heidelberg (2000)
Bachmair, L., Tiwari, A., Vigneron, L.: Abstract congruence closure. J. of Automated Reasoning 31(2), 129–168 (2003)
Dershowitz, N., Jouannaud, J.-P.: Handbook of Theoretical Computer Science: Rewrite Systems, vol. B, pp. 244–320. Elsevier Science Publishers, Amsterdam (1990)
Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpression problem. Journal of the ACM 27(4), 758–771 (1980)
Kapur, D.L.: Shostak’s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, Springer, Heidelberg (1997)
Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press, Oxford (1970)
Kozen, D.: Complexity of Finitely Presented Algebras. PhD. thesis. Cornell University (1977)
Lynch, C., Strogova, P.: SOUR graphs for efficient completion. Journal of Discrete Mathematics and Theoretical Computer Science 2(1), 1–25 (1998)
Nelson, C.G., Oppen, D.C.: Fast Decision Procedures based on Congruence Closure. Journal of the ACM 27(2), 356–364 (1980)
Plaisted, D.A., Sattler-Klein, A.: Proof lengths for equational completion. Journal of Inf. Comput 125(2), 154–170 (1996)
Shostak, R.E.: Deciding Combinations of Theories. Journal of the ACM 31, 1–12 (1984)
Snyder, W.: A Fast Algorithm for Generating Reduced Ground Rewriting Systems from a Set of Ground Equations. Journal of Symbolic Computation 15, 415–450 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scharff, C., Bachmair, L. (2004). On the Combination of Congruence Closure and Completion. In: Buchberger, B., Campbell, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 2004. Lecture Notes in Computer Science(), vol 3249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30210-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30210-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23212-4
Online ISBN: 978-3-540-30210-0
eBook Packages: Springer Book Archive