Matchmaking of web services based on the DAML-S service model

Abstract

DAML-S provides the means for a web service to advertise its functionality to potential users of the service. This brings to fore the issue of discovering an advertisement that best matches a request for a particular service---a process referred to as matchmaking. The algorithms that have thus far been proposed for matchmaking are based on comparisons of the requested and offered inputs and outputs. In this project, we extend these algorithms by taking into account the detailed process description of the service, thus leading to more accurate matchmaking.