Type-Aware Web Service Composition Using Boolean Satisfiability Solver

Authors:
Wonhong Nam;Hyunyoung Kil;Dongwon Lee
Affiliations:
-;-;-
Venue:
CECANDEEE '08 Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services
Year:
2008

Citing 0
Cited 3

Efficient abstraction and refinement for behavioral description based web service composition

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the computational complexity of behavioral description-based web service composition

Theoretical Computer Science
Behavioural description based web service composition using abstraction and refinement

International Journal of Web and Grid Services

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of the Web Service Composition (WSC) problem is 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 this paper, in particular, we study the WSC problem from semantic aspects, exploiting the supertype-subtype relationship among parameters, and propose a novel solutionbased on techniques for the boolean satisfiability problem (SAT). Given a set of web service descriptions and a requirement web service, we reduce the WSC problem into a reachability problem on a state-transition system, and then we find the shortest path for the reachability problem, which is amount to the optimal composition. A preliminary experiment using 7 examples reveals that our proposal can find optimal compositions of web services efficiently.