Abstract
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system ${\mathcal{R}}$ is confluent if all its critical pairs are joinable and the critical pair steps are relatively terminating with respect to ${\mathcal{R}}$. We further show how to encode the rule-labeling heuristic for decreasing diagrams as a satisfiability problem. Experimental data for both methods are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
