DocumentCode
2757401
Title
A Planning Graph Based Algorithm for Semantic Web Service Composition
Author
Yan, Yuhong ; Zheng, Xianrong
Author_Institution
Dept. Comput. Sci. & Software Eng., Concordia Univ., Montreal, QC
fYear
2008
fDate
21-24 July 2008
Firstpage
339
Lastpage
342
Abstract
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.
Keywords
Web services; computational complexity; graph theory; planning (artificial intelligence); semantic Web; AI planning technique; planning graph based algorithm; polynomial time; semantic Web service composition; Artificial intelligence; Computer science; Niobium; Polynomials; Semantic Web; Software algorithms; Software engineering; Sufficient conditions; Technology planning; Web services; Planning graph; Redundancy problem; Web service composition;
fLanguage
English
Publisher
ieee
Conference_Titel
E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services, 2008 10th IEEE Conference on
Conference_Location
Washington, DC
Print_ISBN
978-0-7695-3340-7
Type
conf
DOI
10.1109/CECandEEE.2008.135
Filename
4785085
Link To Document