Unification in free extensions of Boolean rings and Abelian groups
Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß · 2003
A complete unification algorithm is presented for the combination of two arbitrary equational theories E in T(F,X) and E/sup 1/ in T(F',X), where F and F' denote two disjoint sets of function symbols. The method adapts to unification of infinite trees. It is applied to two well-known open problems, when E is the theory of Boolean rings or the theory of Abelian groups, and E is the free theory. The interest to Boolean rings originates in VSLI verification.>