Journal
COMPUTER STANDARDS & INTERFACES
Volume 31, Issue 6, Pages 1108-1117Publisher
ELSEVIER
DOI: 10.1016/j.csi.2008.09.041
Keywords
Semantic annotations; Web service; Discovery; Composition; Matching algorithm
Ask authors/readers for more resources
The automatic discovery and composition of Web services rely on the facilities offered by the providers of services in describing the functionalities of their services semantically and on the description of the client's requests and their needs, without being ambiguous. In this paper, we present a model of Semantic Annotations for Web Services Discovery and its Composition. The proposed approach uses an inter-connected network of semantic Web services describing in OWL-S, using the similarity measure (outputs-inputs similarity) between concepts based on ontology, built before any submitted request. In only one exploration, the composition algorithm can find several composition plans. But the selected composition plan must be the best one according to the quality criteria (similarity, time and memory space). This technique takes advantages from a graph structure, chaining algorithm of expert system and semantic annotations. (C) 2008 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available