Efficient Discovery of Collision-free Service Combinations - Robotics Institute Carnegie Mellon University

Efficient Discovery of Collision-free Service Combinations

Roman Vaculin and Katia Sycara
Conference Paper, Proceedings of IEEE International Conference on Web Services (ICWS '09), pp. 165 - 172, July, 2009

Abstract

Majority of service discovery research considers only primitive services as a suitable match for a given query while service combinations are not allowed. However, many realistic queries cannot be matched by individual services and only a combination of several services can satisfy such queries. Allowing service combinations or proper compositions of primitive services as a valid match introduces problems such as unwanted side-effects (i.e., producing an effect that is not requested), effect duplicities (i.e., producing some effect more than once) and contradictory effects (i.e., producing both an effect and its negation). Also the ranking of matched services has to be reconsidered for service combinations. In this paper, we address all the mentioned issues and present a matchmaking algorithm for retrieval of the best top k collision-free service combinations satisfying a given query.

BibTeX

@conference{Vaculin-2009-10288,
author = {Roman Vaculin and Katia Sycara},
title = {Efficient Discovery of Collision-free Service Combinations},
booktitle = {Proceedings of IEEE International Conference on Web Services (ICWS '09)},
year = {2009},
month = {July},
pages = {165 - 172},
}