In this work we study anti-unification for unranked hedges, permitting context and hedge variables. Hedges are sequences of unranked terms. The anti-unification problem of two hedges and is concerned with finding their generalization, a hedge such that both and are substitution instances of . Second-order power is gained by using context variables to generalize vertical differences at the input hedges. Hedge variables are used to generalize horizontal differences. An anti-unification algorithm is presented, which computes a generalization of input hedges and records all the differences. The computed generalizations are least general among a certain class of generalizations. © 2014 Springer-Verlag.
CITATION STYLE
Baumgartner, A., & Kutsia, T. (2014). Unranked second-order anti-unification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8652 LNCS, pp. 66–80). Springer Verlag. https://doi.org/10.1007/978-3-662-44145-9_5
Mendeley helps you to discover research relevant for your work.