Jordi Levy

Dr. Jordi Levy

orcid

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2013 in Artificial Intelligence
Verified
Journal Article
Closed access
CACarlos Ansotegui
Carlos Ansotegui
MBMaria Luisa Bonet
Maria Luisa Bonet
JLJordi Levy
Jordi Levy

1 June 2007 in Artificial Intelligence
Verified
Journal Article
Closed access
MBMaría Luisa Bonet
María Luisa Bonet
JLJordi Levy
Jordi Levy
FMFelip Manyà
Felip Manyà

1 January 2009
Verified
Book Chapter
Closed access
PDF file
CACarlos Ansotegui
Carlos Ansotegui
MBMaría Luisa Bonet
María Luisa Bonet
JLJordi Levy
Jordi Levy

1 January 2012
Verified
Book Chapter
Closed access
PDF file
CACarlos Ansotegui
Carlos Ansotegui
JCJesús Giráldez Crú
Jesús Giráldez Crú
JLJordi Levy
Jordi Levy

1 May 2000 in Information and Computation
Verified
Journal Article
Closed access
JLJordi Levy
Jordi Levy
MVMargus Veanes
Margus Veanes

19 April 2013 in Journal of Automated Reasoning
Verified
Journal Article
Open access
PDF file
TKTemur Kutsia
Temur Kutsia
JLJordi Levy
Jordi Levy
MVMateu Villaret
Mateu Villaret
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges \({\tilde{s}}_1\) and \({\tilde{s}}_2\) is concerned with finding their generalization, a hedge \({\tilde{q}}\) such that both \({\tilde{s}}_1\) and \({\tilde{s}}_2\) are instances of \({\tilde{q}}\) 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 restricting possible alternatives permitted in the generalizations. The restrictions are imposed with the help of a rigidity function, which is a parameter in the improved algorithm and selects certain common subsequences from the hedges to be generalized. The obtained rigid anti-unification algorithm is further made more precise by permitting combination of hedge and term variables in generalizations. Finally, we indicate a possible application of the algorithm in software engineering.