By Topic

A Planning Graph Based Algorithm for Semantic Web Service Composition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yuhong Yan ; Dept. Comput. Sci. & Software Eng., Concordia Univ., Montreal, QC ; Xianrong Zheng

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.

Published in:

E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services, 2008 10th IEEE Conference on

Date of Conference:

21-24 July 2008