Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time

  • Jean Gallier
  • Paliath Narendran
  • David Plaisted
  • Stan Raatz
  • Wayne Snyder
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 310)


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(n3).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8 References

  1. [1]
    Bachmair, L. “Proof Methods for Equational Theories”, Ph.D thesis, University of Illinois, Urbana Champaign, Illinois (1987).Google Scholar
  2. [2]
    Bachmair, L., Dershowitz, N., and Plaisted, D., “Completion without Failure,” Proceedings of CREAS, Lakeway, Texas (May 1987), also submitted for publication.Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    Dershowitz, N,. “Termination of Rewriting,” Journal of Symbolic Computation 3 (1987) 69–116.Google Scholar
  5. [5]
    Dershowitz, N,. “Completion and its Applications,” Proceedings of CREAS, Lakeway, Texas (May 1987).Google Scholar
  6. [6]
    Downey, Peter J., Sethi, Ravi, and Tarjan, Endre R. “Variations on the Common Subexpressions Problem.” J.ACM 27(4) (1980) 758–771.CrossRefGoogle Scholar
  7. [7]
    Gallier, J.H. Logic for Computer Science: Foundations of Automatic Theorem Proving, Harper and Row, New York (1986).Google Scholar
  8. [8]
    Gallier, J.H., Raatz, S., and Snyder, W., “Theorem Proving using Rigid E-Unification: Equational Matings,” LICS'87, Ithaca, New York (1987) 338–346.Google Scholar
  9. [9]
    Gallier, J.H., Narendran, P., Plaisted, D., and Snyder, W., “Rigid E-Unification is NP-complete,” LICS'88, Edinburgh, Scottland (July 1988)Google Scholar
  10. [10]
    Huet, G., “Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems,” J.ACM 27:4 (1980) 797–821.CrossRefGoogle Scholar
  11. [11]
    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).Google Scholar
  12. [12]
    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.CrossRefGoogle Scholar
  13. [13]
    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).Google Scholar
  14. [14]
    Kozen, Dexter. Complexity of Finitely Presented Algebras, Technical Report TR 76-294, Department of Computer Science, Cornell University, Ithaca, NY (1976).Google Scholar
  15. [15]
    Kozen, Dexter. Complexity of Finitely Presented Algebras, 9th STOC Symposium, Boulder Colorado, 164–177 (May 1977)Google Scholar
  16. [16]
    Lankford, D.S., “Canonical Inference,” Report ATP-32, University of Texas (1975)Google Scholar
  17. [17]
    Nelson Greg, and Oppen, Derek C. Fast Decision Procedures Based on Congruence Closure. J. ACM 27(2) (1980) 356–364.CrossRefGoogle Scholar
  18. [18]
    Otto, F., and Squier, C., “The Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems,” RTA'87, Bordeaux, France (1987) 74–82.Google Scholar

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Jean Gallier
    • 1
  • Paliath Narendran
    • 2
  • David Plaisted
    • 3
  • Stan Raatz
    • 4
  • Wayne Snyder
    • 1
  1. 1.University of PennsylvaniaPhiladelphia
  2. 2.General Electric Company Corporate Research and DevelopmentSchenectady
  3. 3.University of North CarolinaChapel Hill
  4. 4.Rutgers UniversityNew Brunswick

Personalised recommendations