Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
Abstract: Ontology rule editing, testing, debugging and validation are still handcrafted and painful tasks. Nowadays, there is a lack of tools that take these tasks into considerat...
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
Amac Herdagdelen, Massimiliano Ciaramita, Daniel M...