Fast planning through planning graph analysis
Artificial Intelligence
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
Efficient Matchmaking and Directory Services
WI '03 Proceedings of the 2003 IEEE/WIC International Conference on Web Intelligence
WWW '05 Proceedings of the 14th international conference on World Wide Web
A formal model for semantic web service composition
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
| Hi-index | 0.00 |
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches of input/output types. However, this does not work when the available services only cover a part of the range of the input type. We present an algorithm that also allows partial matches and composes them using switches that decide on the required service at runtime based on the actual data type. We report experiments on randomly generated composition problems that show that using partial matches can decrease the failure rate of the integration algorithm using only complete matches by up to 7 times with no increase in the number of directory accesses required. This shows that composition with partial matches is an essential and useful element of web service composition.