9th International Conference on Automated Deduction

Volume 310 of the series Lecture Notes in Computer Science pp 182-196


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

  • Jean GallierAffiliated withUniversity of Pennsylvania
  • , Paliath NarendranAffiliated withGeneral Electric Company Corporate Research and Development
  • , David PlaistedAffiliated withUniversity of North Carolina
  • , Stan RaatzAffiliated withRutgers University
  • , Wayne SnyderAffiliated withUniversity of Pennsylvania

* Final gross prices may vary according to local VAT.

Get Access


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