Specifying a model of semantic web service composition
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 10
Abstract
One of the major issues of semantic web is the discovery and identification of the best service that responds to a user request. In this article we specify a semantic web services composition model built through an ontology described in the logical description language ALN (Attributive Language with unqualified Number restrictions). We then show a method for automatic discovery of semantic web services based on graph theory. In order to make the composition model evolutive, we propose a solution for the insertion of new services, thus avoiding the rebuild of the minimum transversals tree.
Authors and Affiliations
Souleymane OUMTANAGA , Issa TRAORE , Michel BABRI
Keywords
Related Articles
- EP ID EP145230
- DOI -
- Views 106
- Downloads 0
An Integer Programming-based Local Search for Large-scale Maximal Covering Problems
Maximal covering problem (MCP) is classified as a linear integer optimization problem which can be effectively solved by integer programming technique. However, as the problem size grows, integer programming requires exc...
A PATTERN BASED KEY GENERATION TO AUTHENTICATION FOR MULTIHOP ROUTING IN WMSN
Recent research work in the Wireless Sensor Networks involves the homogeneous networks in which the sensor nodes in the specific cluster can get the key value from any other cluster. Most existing key management schemes...
Implementation of Distributed Algorithm with Network Coding for Multicast Network
In today's practical networks, end-to-end information delivery is performed by routing. Network coding generalizes routing by allowing a node to generate output data by mixing (i.e., computing certain functions of) its r...
Efficient construction of Optimal Binary Search Trees using Data Preprocessing to improve Quality and Attribute Post computing to save Space and time through modified Dynamic Programming Technique
There are various methods of handling Optimal Binary search trees in order to improve the performance. One of the methods is Dynamic programming which incurs O(n3) time complexity to store involved computations in a tabl...
Approaches for Managing and Analyzing Unstructured Data
Large volumes of data that will be stored and accessed in future is unstructured. The unstructured data is generated in a very fast pace and uses large storage areas. This increases the storage budget. Extracting value f...