Abstract
A term-rewriting system is said to be a ground system if no variable occurs in any of its rewrite rules. This paper shows that the Church-Rosser Property (i.e., confluence) problem for ground term-rewriting systems is decidable. This is an affirmative solution to this problem posed by Huet and Oppen (1980).
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.
