A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We consider the problem of the unification modulo an equational theory ACh, which consists of a function symbol h that is homomorphic over an associative-commutative operator +. Since the unification modulo ACh theory is undecidable, we define a variant of the problem called bounded ACh unification. In this bounded version of ACh unification, we essentially bound the number of times h can be applied to a term recursively, and only allow solutions that satisfy this bound. There is no bound onarXiv:1811.05602v2 fatcat:eajtulodjzftnloisosohkswm4