Method of Semantic Web Service Discovery and Automatic Composition

Abstract

This paper investigates the semantic information-providing web service composition problem, and proposes a heuristic method of web service automatic composition based on a planning graph model. According to the characteristics of information-providing semantic web service discovery, the service composition is partitioned into two modules: the construction of the planning graph and the search for composition scheme. Thus the satisfaction of the service composition can be judged in polynomial bounded branching time. The rich relationship information from varying percentages of partial to full matched service network is fully considered in the construction process of the planning graph, and the search module of composition scheme further uses a corresponding heuristic service selection strategy. Finally, the experiments verify the efficiency and the strong adaptability of the automated method.