Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time

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

[1]  Leo Bachmair.  Proof methods for equational theories , 1987 .

[2]  Nachum Dershowitz,et al.  Completion and Its Applications , 1989 .

[3]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[4]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[5]  Friedrich Otto,et al.  Th Word Problem for Finitely Presented Monoids and Finite Canonical Rewriting Systems , 1987, RTA.

[6]  Nachum Dershowitz,et al.  Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243. , 1989 .

[7]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[8]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[9]  Sophie Tison,et al.  Decidability of the Confluence of Ground Term Rewriting Systems , 1985, LICS.

[10]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[11]  Dexter Kozen,et al.  Complexity of finitely presented algebras , 1977, STOC '77.

[12]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[13]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[14]  Paliath Narendran,et al.  Rigid E-unification is NP-complete , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[15]  Wayne Snyder,et al.  Theorem Proving Using Rigid E-Unification Equational Matings , 1987, LICS.

[16]  Gillier,et al.  Logic for Computer Science , 1986 .

[17]  Paliath Narendran,et al.  A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System , 1985, Theor. Comput. Sci..