Efficient Discovery of Collision-free Service Combinations

0330987 - ÚI 2010 RIV US eng C - Conference Paper (international conference)
Vaculín, Roman - Sycara, K.
Efficient Discovery of Collision-free Service Combinations.
ICWS 2009. Los Alamitos: IEEE Computer Society, 2009 - (Wei, S.; I-Ling, Y.; Thuraisingham, B.; Bertino, E.), s. 165-172. ISBN 978-1-4244-4929-3.
[ICWS 2009. IEEE International Conference on Web Services. Los Angeles (US), 06.07.2009-10.07.2009]
R&D Projects: GA AV ČR 1ET100300517; GA MŠMT ME08095
Institutional research plan: CEZ:AV0Z10300504
Keywords : discovery of services * services matchmaking * web services combinations * semantic web services * efficient services discovery
Subject RIV: IN - Informatics, Computer Science

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 duplications (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.
Permanent Link: http://hdl.handle.net/11104/0176630