An algorithm for semantic web services composition based on output and input matching

Existed methods for automatic web services composition based on output and input matching are limited to deal with simple Composition Request (CR) which can only be satisfied by linear composition plan, but complicated CR asks for netty plan because the structure of netty plan can be complicated enough to deal with complicated problem while the structure of linear plan is too simple to do that. In order to overcome the shortcoming of the existed methods, a new algorithm is proposed in this paper which can deal with not only simple CR but also complicated CR. A web services connection matrix is used in the proposed algorithm. This matrix is constructed based on the services which participate in a composition to express all output and input matching relations among services. With this matrix, both simple CR and complicated CR can be processed.