Ranked Matching for Service Descriptions Using OWL-S

Abstract

Semantic Web services envision the automated discovery and selection of Web services. This can be realised by adding semantic information to advertised services and service requirements. The discovery and selection process finds matches between requirements and advertisements according to their semantic description. Based on the Web Ontology Language (OWL) an ontology for Web services (OWL-S) was introduced to standardise their semantic description. There are already some approaches available for matching of service requirements with service advertisements according to such an ontology. We propose an algorithm, which ranks the matching degree of service descriptions according to OWL-S. Different matching degrees are achieved based on the contravariance of the input and output types for requested and advertised services. Furthermore, additional elements of the service description, such as the service category, are either covered by reasoning processes or, such as quality of service constraints, by custom matching rules. Contrary to mechanisms that return only success or fail, ranked results provide criteria for the selection of a service among a large set of results. With such a discovery mechanism additional Web services can be found that might have normally been ignored.

Immune-Inspired Method for Selecting the Optimal Solution in Semantic Web Service Composition

“…There are three main approaches to matching : IO-matching [15] ,PE-matching [16] and IOPE-matching [11].…”

Enhancing Service Discovery via Multi-Ontology Management and Annotation

“…[14][15][16] design the constraints as a plug-in into a simple matchmaker version for the desired service. Other work on services discovery includes LARKS (Language for Advertisement and Request for Knowledge Sharing) [8,9], a project based on a collaboration between Toshiba and Carnegie Mellon University [10,11], a Matchmaker from TU-Berlin [12], and systems by Li and Horrocks [13], Paolucci [7] etc. However, these services discovery systems only support matching services using the same or single ontology which both provider and requester share.…”

Dynamic Service Reconfiguration and Enactment Using an Open Matching Architecture

“…This data is stored in the Knoogle broker as an RDF triple relating the match service, the degree of match and the candidate service. Currently, we utilise one similarity service (matcher), namely OWLSM (Jaeger et al, 2005 RDF triples generated by the match services. The query language is triple-store dependent.…”