Automatic Service Composition Using AND/OR Graph

Authors:
Yixin Yan;Bin Xu;Zhifeng Gu
Affiliations:
-;-;-
Venue:
CECANDEEE '08 Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services
Year:
2008

Citing 0
Cited 4

Towards efficiency of QoS-driven semantic web service composition for large-scale service-oriented systems

Service Oriented Computing and Applications
Anytime QoS optimization over the PlanGraph for web service composition

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Algorithms for generating ordered solutions for explicit and/or structures

Journal of Artificial Intelligence Research
An Optimal and Complete Algorithm for Automatic Web Service Composition

International Journal of Web Services Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

As SOC and Web service technology become more widely used, large amounts of services need to be efficiently and effectively composed to meet complex businesses. In this paper, we proposed an approach to resolve the composition problem over large-scale services. We used an inverted table as index for a quick service discovery, and applied a Service Dependency Graph (SDG) and an AND/OR graph as the algorithm basis for parallel compostion. Considering the semantic information described in Web service, our approach also recognizes and transmits the semantic relationships described in Web Ontology Language (OWL).