An algorithm for finding canonical sets of ground rewrite rules in polynomial timeAn algorithm for finding canonical sets of ground rewrite rules in polynomial time

Access Restriction
Subscribed

 Author Gallier, Jean ♦ Narendran, Paliath ♦ Plaisted, David ♦ Raatz, Stan ♦ Snyder, Wayne Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1993 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword Completion procedures ♦ Congruence closure ♦ Equational logic ♦ Term rewriting Abstract In this paper, it is shown that there is an algorithm that, given by finite set $\textit{E}$ of ground equations, produces a reduced canonical rewriting system $\textit{R}$ equivalent to $\textit{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 $\textit{O(n3)}.$ ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1993-01-02 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 40 Issue Number 1 Page Count 16 Starting Page 1 Ending Page 16

Open content in new tab

Source: ACM Digital Library