Precise matching of semantic web services

  • Authors:
  • Yonglei Yao;Sen Su;Fangchun Yang

  • Affiliations:
  • State Key Laboratory of Networking & Switching Technology, Beijing University of Posts & Telecommunications (BUPT), Beijing, China;State Key Laboratory of Networking & Switching Technology, Beijing University of Posts & Telecommunications (BUPT), Beijing, China;State Key Laboratory of Networking & Switching Technology, Beijing University of Posts & Telecommunications (BUPT), Beijing, China

  • Venue:
  • ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Matchmaking is an important aspect of the Web Services interactions, which enables a service requester to locate the most suitable counterpart. However, current service matching algorithms operate on service advertisements, which don’t contain enough information to select a service instance that the consumer can immediately interact with. In this paper, we propose a precise matching algorithm, based on WS-Agreement and OWL-S, to deal with this challenge. We show how to combine WS-Agreement with OWL-S to obtain an agreement-style service description, and how the degree of match between two descriptions of this style is calculated.