A planning graph based algorithm for semantic web service composition

Proceedings - 10th IEEE Joint Conference on E-Commerce Technology and the 5th Enterprise Computing, E-Commerce and E-Services, CEC 2008 and EEE 2008

Volumn , Issue , 2008, Pages 339-342

  Yan, Yuhong ^a   Zheng, Xianrong ^b  

^a Civil and Environmental Engineering   (Canada)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AI-PLANNING; PLANNING GRAPHS; POLYNOMIAL-TIME; SEARCH SPACES; SEMANTIC WEB SERVICES; WEB SERVICE COMPOSITIONS;

INFORMATION THEORY; POLYNOMIAL APPROXIMATION; SEMANTIC WEB; SEMANTICS; WEB SERVICES;

ELECTRONIC COMMERCE;

EID: 63749119962     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CECandEEE.2008.135     Document Type: Conference Paper

References (4)

1. http://ws-challenge.org.
2. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2), 1994.
3. M. Ghallab, D. Nau, and P. Traverso. Automated Planning Theory and Practice. Morgan Kaufmann Publishers,San Francisco, 2004.
4. B. Stauss, K. Engelmann, A. Kremer, and A. Luhn. Services Science: Fundamentals, Challenges and Future Developments. Springer,Berlin, 2007.