A generic matching algorithm for semantic discovery
No hay miniatura disponible
Fecha
2007
Título de la revista
ISSN de la revista
Título del volumen
Editor
IEEE
Resumen
This paper presents a generic semantic discovery algorithm, based in OWL, for UDDI registries that is not bound to any specific ontology or concepts from it. It enables to match instances and properties without specifically knowing the ontologies being matched and it enables to use all concepts contained in the request resulting in a matching closer to the user needs. Also, the generality of the proposed algorithm enables to change the ontology being used to describe an element in the registry without needing to modify the algorithm and therefore, it enables to use other OWL ontologies to describe the information stored in the registry
Descripción
Ponencia presentada en la 3rd International Conference on Semantics, Knowledge, and Grid, SKG, celebrada en Xi'an entre el 29 y el 31 de octubre de 2007.
Materias
Citación
Aguilera, U., Abaitua, J., Díaz-Labrador, J., Buján, D., & De Ipiña, D. L. (2007). A generic matching algorithm for semantic discovery. 3rd International Conference on Semantics, Knowledge, and Grid, SKG 2007, 442-445. https://doi.org/10.1109/SKG.2007.104