Complete sets of unifiers and matchers in equational theories (Q1820760): Difference between revisions

An abstract framework to present unification and matching problems is proposed. The nonexistence of complete sets of minimal unifiers (and matchers) in some equational theories, even regular, is proved. The paper (a preliminary version was presented at CAAP '83 [Lect. Notes Comput. Sci. 159, 205-220 (1983; Zbl 0545.03003)]) is also a good review of previous work related to the afore-mentioned problems and contains an excellent list of references.