Fuzzy matchmaking for Web services

To fully realise the potential of Web services it is necessary to develop viable dynamic discovery and composition techniques. Matchmaking is considered as one of the crucial factors to ensure dynamic discovery and composition of Web services. Current matchmaking methods are inadequate given their inability to abstract and classify the underlying data of Web services. Instead, they classify Web services based on the capability of services, software signatures, and so on. This paper proposes a novel framework which exploits fuzzy logic in order to abstract and classify the underlying data of Web services as fuzzy terms and rules. The aim is to increase the efficiency of the discovery of Web services and to allow imprecise or vague terms in the search query.

[1]  Jerry R. Hobbs,et al.  DAML-S: Semantic Markup for Web Services , 2001, SWWS.

[2]  Matthias Klusch,et al.  Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace , 2002, Autonomous Agents and Multi-Agent Systems.

[3]  Yanchun Zhang,et al.  Web Service Composition with Case-Based Reasoning , 2003, ADC.

[4]  Eleni Stroulia,et al.  Flexible interface matching for Web-service discovery , 2003, Proceedings of the Fourth International Conference on Web Information Systems Engineering, 2003. WISE 2003..

[5]  Christos Faloutsos,et al.  A survey of information retrieval and filtering methods , 1995 .

[6]  Michael R. Genesereth,et al.  Knowledge Interchange Format , 1991, KR.

[7]  David M. Booth,et al.  Web Services Architecture , 2004 .

[8]  Matthew MacDonald,et al.  Web Services Architecture , 2004 .