Web services composition based on weighted planning graph
For the sake of fulfilling a more complex and more powerful service function, a method of web service composition (WSC-WPG),which is based on weighted planning graph is proposed. The method using AI Graph-plan consists of two phases. The first one is to construct the planning graph , which can find a service composition in a polynomial time in distributed and heterogeneous web services. The second one uses reserved iterative method to search the optimal composition solution in planning graph. Experiments show that, WSC-WPG has greatly improved the efficiency of combination.
ontology web service OWLS services composition planning graph
Wenqiang Li Xuemei Dai Hao Jiang
School of Computer Science & Engineering Southeast University Nanjing ,China
国际会议
杭州
英文
89-93
2010-10-21(万方平台首次上网日期,不代表论文的发表时间)