Abstract
When there do not exist the directly matched services but exist several services in the repository that can be combined to meet the requirements, how to discovery the multiple services and their composition relations are the critical issues. This paper proposes a composition-oriented and AND/OR graph-based service search method named as CoSA, which can automatically search the composition relation graph in concepts level and composition plan in implement level. Composition operator and domain characteristics are reflected in the heuristic functions. CoSA decreases the service search space and improves the search effectiveness. By unifying the service search and composition problems into one composition-oriented service search problem, CoSA enables the dynamic and automatic service composition. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Xie, X., Chen, K., & Li, J. (2006). A composition oriented and graph-based service search method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4185 LNCS, pp. 530–536). Springer Verlag. https://doi.org/10.1007/11836025_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
