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)

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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