{'fraction_non_alphanumeric': 0.024539877300613498, 'fraction_numerical': 0.0, 'mean_word_length': 4.8023715415019765, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Constraint-based Approach to Web Services Provisioning

In this paper we consider the provisioning problem of Web ser- vices. Our framework is based on the existence of an abstract composition, i.e., the way some services of dierent types can be combined together in order to achieve a given task. Our approach consists in instantiating this abstract repre- sentation of a composite Web service by selecting the most appropriate concrete Web services. This instantiation is based on constraint programming techniques which allows us to match the Web services according to a given request. Our proposal performs this instantiation in a distributed manner, i.e., the solvers for each service type are solving some constraints at one level, and they are forwarding the rest of the request (modied by the local solution) to the next services. When a service cannot provision part of the composition, a distributed backtrack mechanism enables to change previous solutions (i.e., provisions). A major interest of our approach is to preserve privacy: solutions are not sent to the whole composition, services know only the services to which they are con- nected, and parts of the request that are already solved are removed from the next requests. We introduce a specic data structure, namely Message Treatment Struc- ture, for modeling the problem. We show the interest of this data structure to express the general principles of our framework and the related algorithms.