Abstract
In this paper, it is shown that there is an algorithm which, given any finite set E of ground equations, produces a reduced canonical rewriting system R equivalent to E in polynomial time. This algorithm based on congruence closure performs simplification steps guided by a total simplification ordering on ground terms, and it runs in time O(n 3).
This research was partially supported by the National Science Foundation under Grant No DCR-86-07156.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
8 References
Bachmair, L. “Proof Methods for Equational Theories”, Ph.D thesis, University of Illinois, Urbana Champaign, Illinois (1987).
Bachmair, L., Dershowitz, N., and Plaisted, D., “Completion without Failure,” Proceedings of CREAS, Lakeway, Texas (May 1987), also submitted for publication.
Dauchet, M., Tison, S., Heuillard, T., and Lescanne, P., “Decidability of the Confluence of Ground Term Rewriting Systems,” LICS'87, Ithaca, New York (1987) 353–359.
Dershowitz, N,. “Termination of Rewriting,” Journal of Symbolic Computation 3 (1987) 69–116.
Dershowitz, N,. “Completion and its Applications,” Proceedings of CREAS, Lakeway, Texas (May 1987).
Downey, Peter J., Sethi, Ravi, and Tarjan, Endre R. “Variations on the Common Subexpressions Problem.” J.ACM 27(4) (1980) 758–771.
Gallier, J.H. Logic for Computer Science: Foundations of Automatic Theorem Proving, Harper and Row, New York (1986).
Gallier, J.H., Raatz, S., and Snyder, W., “Theorem Proving using Rigid E-Unification: Equational Matings,” LICS'87, Ithaca, New York (1987) 338–346.
Gallier, J.H., Narendran, P., Plaisted, D., and Snyder, W., “Rigid E-Unification is NP-complete,” LICS'88, Edinburgh, Scottland (July 1988)
Huet, G., “Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,” J.ACM 27:4 (1980) 797–821.
Huet, G. and Oppen, D. C., “Equations and Rewrite Rules: A Survey,” in Formal Languages: Perspectives and Open Problems, R.V. Book, ed., Academic Press, New York (1982).
Kapur, D., and Narendran, P., “A Finite Thue System With Decidable Word Problem and Without Equivalent Finite Canonical System,” Theoret. Comp. Sci. 35 (1985) 337–344.
Knuth, D.E. and Bendix, P.B., “Simple Word Problems in Univeral Algebras,” in Computational Problems in Abstract Algebra, Leech, J., ed., Pergamon Press (1970).
Kozen, Dexter. Complexity of Finitely Presented Algebras, Technical Report TR 76-294, Department of Computer Science, Cornell University, Ithaca, NY (1976).
Kozen, Dexter. Complexity of Finitely Presented Algebras, 9th STOC Symposium, Boulder Colorado, 164–177 (May 1977)
Lankford, D.S., “Canonical Inference,” Report ATP-32, University of Texas (1975)
Nelson Greg, and Oppen, Derek C. Fast Decision Procedures Based on Congruence Closure. J. ACM 27(2) (1980) 356–364.
Otto, F., and Squier, C., “The Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems,” RTA'87, Bordeaux, France (1987) 74–82.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gallier, J., Narendran, P., Plaisted, D., Raatz, S., Snyder, W. (1988). Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012832
Download citation
DOI: https://doi.org/10.1007/BFb0012832
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19343-2
Online ISBN: 978-3-540-39216-3
eBook Packages: Springer Book Archive