Anti-Uniﬁcation for Unranked Terms and Hedges

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat de Girona > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/10256/8402

dc.contributor.author	Kutsia, Temur
dc.contributor.author	Levy, Jordi
dc.contributor.author	Villaret i Ausellé, Mateu
dc.date	2011
dc.identifier.citation	1868-8969
dc.identifier.citation	http://dx.doi.org/10.4230/LIPIcs.RTA.2011.219
dc.identifier.uri	http://hdl.handle.net/10256/8402
dc.format	application/pdf
dc.language.iso	eng
dc.publisher	Dagstuhl Publishing
dc.relation	MINECO/PN 2013-2015/TIN2012-33042
dc.relation	MINECO/PN 2011-2013/TIN2010-20967-C04-01
dc.relation	AGAUR/2009-2013/2009 SGR-1434
dc.relation	Reproducció digital del document publicat a: http://dx.doi.org/10.4230/LIPIcs.RTA.2011.219
dc.relation	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
dc.relation	Articles publicats (D-IMA)
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Algorismes computacionals
dc.subject	Computer algorithms
dc.subject	Lògica matemàtica
dc.subject	Logic, Symbolic and mathematical
dc.subject	Complexitat computacional
dc.subject	Computational complexity
dc.title	Anti-Uniﬁcation for Unranked Terms and Hedges
dc.type	info:eu-repo/semantics/article
dc.type	info:eu-repo/semantics/publishedVersion
dc.description.abstract	We study anti-uniﬁcation for unranked terms and hedges that may contain term and hedge variables. The anti-uniﬁcation problem of two hedges S1 and S2 is concerned with ﬁnding their generalization, a hedge ǭ such that both S1 and S2 are instances of ǭ under some substitutions. Hedge variables help to ﬁll in gaps in generalizations, while term variables abstract single (sub)terms with diﬀerent top function symbols. First, we design a complete and minimal algorithm to compute least general generalizations. Then, we improve the eﬃciency 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
dc.description.abstract	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

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author