Automatic Service Composition Using AND/OR Graph

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).