1. Nominal Anti-Unification
- Author
-
Baumgartner, Alexander, Kutsia, Temur, Levy, Jordi, Villaret, Mateu, Austrian Science Fund, and Ministerio de Economía y Competitividad (España)
- Subjects
000 Computer science, knowledge, general works ,Equivariance ,Computer Science ,Term-in-context ,Nominal anti-unification - Abstract
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in generalizations is finite, then there exists a least general generalization which is unique modulo variable renaming and α-equivalence. We present an algorithm that computes it. The algorithm relies on a subalgorithm that constructively decides equivariance between two terms-in-context. We prove soundness and completeness properties of both algorithms and analyze their complexity. Nominal anti-unification can be applied to problems were generalization of first-order terms is needed (inductive learning, clone detection, etc.), but bindings are involved. © Alexander Baumgartner, Temur Kutsia, Jordi Levy, and Mateu Villaret., This research has been partially supported by the Spanish project HeLo (TIN2012-33042), by the Austrian Science Fund (FWF) with the project SToUT (P 24087-N18), and by the strategic program “Innovatives OÖ 2010plus” by the Upper Austrian Government
- Published
- 2015