Anti-unification

Anti-unification is the process of constructing a generalization common to two given symbolic expressions. As in <a href="/facts/Unification_(computer_science)/4EPHSB1T">unification</a>, several frameworks are distinguished depending on which expressions (also called terms) are allowed, and which expressions are considered equal. If variables representing functions are allowed in an expression, the process is called "higher-order anti-unification", otherwise "first-order anti-unification". If the generalization is required to have an instance literally equal to each input expression, the process is called "syntactical anti-unification", otherwise "E-anti-unification", or "anti-unification modulo theory".
An anti-unification algorithm should compute for given expressions a complete and minimal generalization set, that is, a set covering all generalizations and containing no redundant members, respectively. Depending on the framework, a complete and minimal generalization set may have one, finitely many, or possibly infinitely many members, or may not exist at all; it cannot be empty, since a trivial generalization exists in any case. For first-order syntactical anti-unification, <a href="/facts/Gordon_Plotkin/2CrnVkVj">Gordon Plotkin</a> gave an algorithm that computes a complete and minimal singleton generalization set containing the so-called "least general generalization" (lgg).
Anti-unification should not be confused with <a href="/facts/Dis-unification_(computer_science)/7Wc25vNU">dis-unification</a>. The latter means the process of solving systems of <a href="/facts/Inequation/BuBq2Bwb">inequations</a>, that is of finding values for the variables such that all given inequations are satisfied. This task is quite different from finding generalizations.

Anti-unification open-in-new

Anti-unification