A Method For Semantic Web Service Composition Based On Pattern Matching
The composition of semantic web services is a very important and actual problem in the semantic web services research area. There are several semi-automatic approaches for this problem, but most of the results are related to automatic approaches. In this paper we present an automatic approach for the composition of semantic web services based on pattern matching. We consider a special type of semantic description, represented as a list of semantic descriptions corresponding to several semantic web services. The semantic description related to the semantic web service that we want to obtain is decomposed until all the parts of the semantic description correspond to semantic web services from a library. In the end, all the necessary semantic web services found in the library are composed in order to obtain the semantic web service that we wanted to construct.
|Date of creation:||Aug 2010|
|Date of revision:|
|Contact details of provider:|| Postal: 15-17 Dorobanti Road , Bucharest ,71131|
Phone: 004 021 2112650
Fax: 004 021 3112066
Web page: http://www.csie.ase.ro/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:rom:km2010:29. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mogos Radu)
If references are entirely missing, you can add them using this form.