Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time
- First Online:
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.