Anti-Unification for Unranked Terms and Hedges
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges S1 and S2 is concerned with finding their generalization, a hedge ǭ such that both S1 and S2 are instances of ǭ under some substitutions. Hedge variables help to...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10256/8402 |
| Acceso en línea: | http://hdl.handle.net/10256/8402 |
| Access Level: | acceso abierto |
| Palabra clave: | Algorismes computacionals Computer algorithms Lògica matemàtica Logic, Symbolic and mathematical Complexitat computacional Computational complexity |
| Sumario: | We study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges S1 and S2 is concerned with finding their generalization, a hedge ǭ such that both S1 and S2 are instances of ǭ under some substitutions. Hedge variables help to fill in gaps in generalizations, while term variables abstract single (sub)terms with different top function symbols. First, we design a complete and minimal algorithm to compute least general generalizations. Then, we improve the efficiency of the algorithm by restrictingpossible alternatives permitted in the generalizations. The restrictions are imposed with the help of a rigidity function that is a parameter in the improved algorithm and selects certain common subsequences from the hedges to be generalized. Finally, we indicate a possible application of the algorithm in software engineering |
|---|