An Algorithm for SWS Matching Based on Subsumption Relation Defined in Domain Ontology

Semantic Web Services (SWS) is proposed to ensure Web Service core missions automation, nevertheless, a dedicated Web Service discovery technology based on SWS is desired currently. For this reason, we propose an effective SWS matching algorithm to achieve service discovery based on semantics. In the paper, we first refine core properties and requirements to apply subsumption relation to involved SWS matching method, which is based on the semantic information of service´s inputs and outputs. Then, we discuss a feasible service semantic matching algorithm in detail. Next, we implement and test it in related SWS registry. Finally, we point out its main properties. In fact, the algorithm proves to fully satisfy our expectations and be practical and feasible.