Name
Abstract | ||
|---|---|---|
In this paper, it is shown that there is an algorithm that, given by 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). |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1145/138027.138032 | J. ACM |
Keywords | DocType | Volume |
completion procedures,congruence closure,equational logic,term rewriting | Journal | 40 |
Issue | ISSN | Citations |
1 | 0004-5411 | 25 |
PageRank | References | Authors |
1.27 | 16 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean H. Gallier | 1 | 749 | 111.86 |
| Paliath Narendran | 2 | 1100 | 114.99 |
| David A. Plaisted | 3 | 1680 | 255.36 |
| Stan Raatz | 4 | 176 | 37.68 |
| Wayne Snyder | 5 | 25 | 1.27 |