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

Descripción completa

Detalles Bibliográficos
Autores: Kutsia, Temur, Levy, Jordi, Villaret i Ausellé, Mateu
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
id ES_dca92ba82d31b82a9039738ec4e96d03
oai_identifier_str oai:recercat.cat:10256/8402
network_acronym_str ES
network_name_str España
repository_id_str
spelling Anti-Unification for Unranked Terms and HedgesKutsia, TemurLevy, JordiVillaret i Ausellé, MateuAlgorismes computacionalsComputer algorithmsLògica matemàticaLogic, Symbolic and mathematicalComplexitat computacionalComputational complexityWe 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 engineeringThis 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-1434Dagstuhl PublishingMinisterio de Economía y Competitividad (Espanya)Generalitat de Catalunya. Agència de Gestió d'Ajuts Universitaris i de Recerca2011info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/10256/8402http://hdl.handle.net/10256/8402Leibniz 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-234Articles publicats (D-IMA)reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)Inglésinfo:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.RTA.2011.219info:eu-repo/semantics/altIdentifier/issn/1868-8969info:eu-repo/grantAgreement/MINECO//TIN2012-33042info:eu-repo/grantAgreement/MICINN//TIN2010-20967-C04-01AGAUR/2009-2013/2009 SGR-1434Attribution-NonCommercial-NoDerivs 3.0 Spainhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:recercat.cat:10256/84022026-05-29T05:05:01Z
dc.title.none.fl_str_mv Anti-Unification for Unranked Terms and Hedges
title Anti-Unification for Unranked Terms and Hedges
spellingShingle Anti-Unification for Unranked Terms and Hedges
Kutsia, Temur
Algorismes computacionals
Computer algorithms
Lògica matemàtica
Logic, Symbolic and mathematical
Complexitat computacional
Computational complexity
title_short Anti-Unification for Unranked Terms and Hedges
title_full Anti-Unification for Unranked Terms and Hedges
title_fullStr Anti-Unification for Unranked Terms and Hedges
title_full_unstemmed Anti-Unification for Unranked Terms and Hedges
title_sort Anti-Unification for Unranked Terms and Hedges
dc.creator.none.fl_str_mv Kutsia, Temur
Levy, Jordi
Villaret i Ausellé, Mateu
author Kutsia, Temur
author_facet Kutsia, Temur
Levy, Jordi
Villaret i Ausellé, Mateu
author_role author
author2 Levy, Jordi
Villaret i Ausellé, Mateu
author2_role author
author
dc.contributor.none.fl_str_mv Ministerio de Economía y Competitividad (Espanya)
Generalitat de Catalunya. Agència de Gestió d'Ajuts Universitaris i de Recerca
dc.subject.none.fl_str_mv Algorismes computacionals
Computer algorithms
Lògica matemàtica
Logic, Symbolic and mathematical
Complexitat computacional
Computational complexity
topic Algorismes computacionals
Computer algorithms
Lògica matemàtica
Logic, Symbolic and mathematical
Complexitat computacional
Computational complexity
description 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
publishDate 2011
dc.date.none.fl_str_mv 2011
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10256/8402
http://hdl.handle.net/10256/8402
url http://hdl.handle.net/10256/8402
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.4230/LIPIcs.RTA.2011.219
info:eu-repo/semantics/altIdentifier/issn/1868-8969
info:eu-repo/grantAgreement/MINECO//TIN2012-33042
info:eu-repo/grantAgreement/MICINN//TIN2010-20967-C04-01
AGAUR/2009-2013/2009 SGR-1434
dc.rights.none.fl_str_mv Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Dagstuhl Publishing
publisher.none.fl_str_mv Dagstuhl Publishing
dc.source.none.fl_str_mv 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
Articles publicats (D-IMA)
reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869421788965896192
score 15.812429

Similares en LA Referencia