Anti-Unification: Algorithms and Applications

1 pages•Published: July 29, 2013

Abstract

The anti-unification problem of two terms t₁ and t₂ is concerned with finding a term t which generalizes both t₁ and t₂. That is, the input terms should be substitution instances of the generalization term. Interesting generalizations are the least general ones. The purpose of anti-unification algorithms is to compute such least general generalizations.

Research on anti-unification has been initiated more than four decades ago, with the pioneering works by Gordon~D.~Plotkin and John~C.~Reynolds. Since then, a number of algorithms and their modifications have been developed, addressing the problem in first-order or higher-order languages, for syntactic or equational theories, over ranked or unranked alphabets, with or without sorts/types, etc. Anti-unification has found applications in machine learning, inductive logic programming, case-based reasoning, analogy making, symbolic mathematical computing, software maintenance, program analysis, synthesis, transformation, and verification. Some of these algorithms and applications will be reviewed in the talk. We will also consider recent developments in unranked and higher-order generalization computation.

In: Konstantin Korovin and Barbara Morawska (editors). UNIF 2013. 27th International Workshop on Unification, vol 19, pages 2--2

Links:	https://easychair.org/publications/paper/nT4h
	https://doi.org/10.29007/jbx2