| Title | An algorithm for SWS matching based on subsumption relation defined in domain ontology |
| Authors | Zhao, Yun Si, Huayou Qi, Hengnian Ni, Yulin |
| Affiliation | School of Information Engineering, Zhejiang Forestry University, Lin'an 311300, China Software Institute, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China School of Software and Microelectronics, Peking University, Beijing 102600, China |
| Issue Date | 2010 |
| Citation | 2010 International Conference on Management and Service Science, MASS 2010.Wuhan, China. |
| Abstract | 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. ? 2010 IEEE. |
| URI | http://hdl.handle.net/20.500.11897/329552 |
| DOI | 10.1109/ICMSS.2010.5577324 |
| Indexed | EI |
| Appears in Collections: | 信息科学技术学院 软件与微电子学院 |
