Efficient Semantic Web Service Discovery in Centralized and P2P Environments
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Top-k dominant web services under multi-criteria matching
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Exploiting User Feedback to Improve Semantic Web Service Discovery
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Graph-based matching of composite OWL-S services
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Mapping between heterogeneous XML and OWL transaction representations in B2B integration
Data & Knowledge Engineering
Hi-index | 0.00 |
This paper presents an algorithm to match a semantic Web service request against semantic Web service advertisements. The algorithm is to be used by systems to discover semantic Web services, such as the UDDI. Matching is based on the assessment of the similarity among semantic Web service properties, such as inputs and outputs. Semantic Web services have their inputs and outputs annotated or described by ontological concepts. The algorithm is able to match a semantic Web service request against advertisements that are annotated with concepts with and without a common ontology commitment. The similarity of inputs and outputs is evaluated based on concepts (classes), their semantic relations, and their common and distinguishing features (properties