Item


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 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

This research has been partially supported by the Spanish Ministerio de Economa y Competitividad under the projects HeLo (TIN2012-33042) and TASSAT (TIN2010-20967-C04-01), by the EC FP6 for Integrated Infrastructures Initiatives under the project SCIEnce (contract No. 026133), by the Austrian Science Fund (FWF) under the project SToUT (P 24087-N18), and by the Generalitat de Catalunya under the grant AGAUR 2009-SGR-1434

Leibniz International Proceedings in Informatics (LIPPICS) : 22nd International Conference on Rewriting Techniques and Applications (RTA’11) : May 30 - June 1, 2011, Novi Sad, Serbia, 2011, vol. 10, P. 219-234

Dagstuhl Publishing

Author: Kutsia, Temur
Levy, Jordi
Villaret i Ausellé, Mateu
Date: 2011
Abstract: 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
This research has been partially supported by the Spanish Ministerio de Economa y Competitividad under the projects HeLo (TIN2012-33042) and TASSAT (TIN2010-20967-C04-01), by the EC FP6 for Integrated Infrastructures Initiatives under the project SCIEnce (contract No. 026133), by the Austrian Science Fund (FWF) under the project SToUT (P 24087-N18), and by the Generalitat de Catalunya under the grant AGAUR 2009-SGR-1434
Format: application/pdf
ISSN: 1868-8969
Document access: http://hdl.handle.net/10256/8402
Language: eng
Publisher: Dagstuhl Publishing
Collection: MINECO/PN 2013-2015/TIN2012-33042
MINECO/PN 2011-2013/TIN2010-20967-C04-01
AGAUR/2009-2013/2009 SGR-1434
Reproducció digital del document publicat a: http://dx.doi.org/10.4230/LIPIcs.RTA.2011.219
Articles publicats (D-IMA)
Is part of: Leibniz International Proceedings in Informatics (LIPPICS) : 22nd International Conference on Rewriting Techniques and Applications (RTA’11) : May 30 - June 1, 2011, Novi Sad, Serbia, 2011, vol. 10, P. 219-234
Rights: Attribution-NonCommercial-NoDerivs 3.0 Spain
Rights URI: http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Subject: Algorismes computacionals
Computer algorithms
Lògica matemàtica
Logic, Symbolic and mathematical
Complexitat computacional
Computational complexity
Title: Anti-Unification for Unranked Terms and Hedges
Type: info:eu-repo/semantics/article
Repository: DUGiDocs

Subjects

Authors