Skip to Main Content
In most of research, service composition and discovery are treated separately. In the composition, it is assumed that primitive services are known to the composition component in advance. At the same time, in matchmaking algorithms, usually only one service is considered as a suitable candidate satisfying a query while service combinations are not allowed. The problem is that in realistic composition or mediation scenarios in dynamic environments some specific gap can be bridged only by using a combination of several services which are not known and need to be discovered. We consider such a situation and we propose an approach using a combined match and a composed match. We give a characterization of these two matching types and we develop appropriate matching algorithms.