SAT solving technique for semantic web service composition

Abstract

The Web Service Composition (WSC) problem aims to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic features when no single service satisfies it. In particular, the semantics of services can help a composition engine find more correct, complete, consistent and optimal candidates as a solution. In this paper, we study the WSC problem considering semantic aspects, e.g., exploiting the semantic relationship between parameters of web services. Given a set of web service descriptions, an ontology and a requirement web service, we find the optimal composition which contains the smallest number of semantically well connected web services, by using semantic matchmaking and a boolean satisfiability solver. In a preliminary experiment, our proposal can find optimal compositions of web services efficiently. © 2012 Springer-Verlag Berlin Heidelberg.