Abstract
As a greater number of Web Services are made available, support for service discovery mechanisms become essential. Services can have quite different Quality of Service characteristics (such as their response time when given a particular set of data). A service requestor therefore requires more sophisticated approaches to find a service that meets a particular behavior, because supporting matching between a service request and properties is not straightforward. Matchmaking plays a vital role in this discovery process. We propose a novel matchmaking algorithm to effectively compute the semantic distance of concepts in an ontology. It is based on description logic formalization and reasoning, extends simple subsumption matching found in other approaches and allows match ranking. We have implemented the proposed approach and used the developed prototype in the context of service discovery in the visualization domain.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.