Abstract

Completion modulo a congruence is a method for constructing a presentation of an equational theory as a rewrite system that defines unique normal forms with respect to the congruence. We formulate this completion method as an equational inference system and present techniques for proving the correctness of procedures based on the inference system. Our correctness results cover generalized and improved versions of the Peterson-Stickel and the Jouannaud-Kirchner procedure.

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 call

Disclaimer: 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.