A Generic Matching Algorithm for Semantic Discovery

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

Full description

Saved in:
Bibliographic Details
Published inSKG 2007 : proceedings : third International Conference on Semantics, Knowledge and Grid : Xi'an, Shan Xi, China, 29-31 October 2007 pp. 442 - 445
Main Authors Aguilera, Unai, Abaitua, Joseba, Diaz-Labrador, Josuka, Bujan, David, de Ipina, Diego Lopez
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2007
Subjects
Business communication
Ontologies
OWL
Semantic Web
Web services
Online AccessGet full text
ISBN0769530079
9780769530079
DOI10.1109/SKG.2007.104

Cover

More Information
Summary: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.
ISBN:0769530079
9780769530079
DOI:10.1109/SKG.2007.104