Citation Context

...mportant to support the Web service discovery problem. We argue that semantic level mediation strongly relies on identifying semantic similarities between entities across different SWS ontologies [18]=-=[26]-=-. However, semantic similarity is not an implicit notion within existing SWS representations (e.g. based on WSMO 1 [9] or OWL-S 2 ). Moreover, automatic similarity detection as demanded by semantic me...

Citation Context

...lly different semantic annotations, such as concepts and instances which are part of different SWS. However, since this is a fundamental requirement to enable matchmaking across heterogeneous SWS [22]=-=[27]-=-, large-scale interoperability is not facilitated. In this paper, we propose a representational approach which enriches the expressiveness of SWS approaches with formal representations following the C...

Citation Context

...result from heterogeneous data semantics. Based on METEOR-S, semantic annotation and mapping are proposed to deal with schema structural heterogeneity of the exchanged messages in service composition =-=[25, 26]-=-. The approach in [27] use data transformation rules, which are specified in a Prolog notation, to convert the exchanged messages/data from the upstream service to the downstream one. The approach can...

Citation Context

...olicies to decide whether to grant the access or not. Related work. Many works have been dedicated to Web service composition. Several approaches are based on automata representations of Web services =-=[3, 4, 25, 15]-=- and reduce the composition problem to the synthesis of an automata exhibiting the same behavior as a goal service and built from available services, themselves modelled by automatas. Thus, these appr...

Citation Context

...g this problem. Many researchers have studied the problem of data mediation in general and in regard to Web services. So far, there are mainly two algorithms using SAWSDL for data mediation: top-down =-=[17, 21]-=- and bottom-up [2, 22]. For the top-down algorithm, the main idea is to traverse the target XML schema tree in a top-down manner, and try to fill in each node with the data in the source XML schema. T...

Citation Context

...xity trade-off is a challenge to deal with (i.e., low complexity logic leads to efficient reasoning, but limited expressivity). For the more difficult problem of automatic composition, our prior work =-=[11]-=- extended the GraphPlan algorithm and utilized tri-state propositional logic and description logic. In our current work which is less dependent on using a planner, we intend to allow more expressive p...

Citation Context

...ead. This permits spontaneous interaction between services not originally designed to work together. Automatically building concrete adapters from one concept to another is a research field by itself =-=[5, 14]-=- and we are not trying to tackle this problem. Composing existing services to create new ones also improves flexibility of systems and spontaneous interactions. One can choose a set of existing servic...

Citation Context

...e + - - - - - +/- - - + + [4] Modal - + + + + - - + - - - [22] LP - - - - - - +/- + +/- - + [6] Type Match + + - +/- - - + - - + + [17] Cashew - + - + + + - + - - - [23] Shop2 - + - +/- + + - + - - + =-=[29]-=- GraphPlan - + - + - +/- - + - - + [19] Sword + - - +/- +/- - - - - - + [18] STS - + + + + +/- - + + - + this paper CBC + + + + + - +/- + + + + Table 1. Comparing SWS Composition approaches Figure 3. ...

Citation Context

...hat phase. They also do not discusssdetails of the pros and cons of the various options for each phase.s5sFinally, there has been some work in the geospatial domain related to web servicescomposition =-=[10, 19, 20]-=-. However, these works suffer the same limitations that exist insthe general web service composition literature. They either do not provide a usefulsframework [10, 19] or focus on the use of a set of ...