Completion for unification (Q1178701)

This is an elaboration of a method of constructing unification algorithms for specific classes of equational theories proposed by the second author [Computing unification algorithms, Proc. 1st Symp. on Logic in Computer Science, Boston, 206-216 (1986)]. In particular, a completion procedure is developed which, if it terminates, transforms a set of linear axioms of a theory \(A\) into a presentation of \(A\) in ''resolvent'' form, from which a unification algorithm can be derived automatically.