Abstract
Semantic unification has been much studied since the early days of automated reasoning, and theories such as commutativity and associativity-commutativity (AC) have been built into a number of theorem provers and term rewriting engines. Associativity, which captures the notion of lists, might be considered even more basic than AC, which captures the notion of multisets. However despite being decidable, associative unification has not been widely implemented in general purpose systems, due to its infinitary nature and the high complexity of available algorithms.In this paper we describe the support for associative unification implemented in the Maude system, which is incomplete, but handles many useful cases and smoothly combines with other supported theories.
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 callMore From: Journal of Logical and Algebraic Methods in Programming
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.
