A Planning Graph Based Algorithm for Semantic Web Service Composition

Many automatic Web service composition algorithms based on AI planning techniques have been proposed. In this paper, we model the semantic Web service composition problem using a kind of simplified planning graph. It provides a unique search space, and can find a solution in polynomial time, but with possible redundant Web services.