The research of service composition based on granular computing

Granular computing is a tough topic on processing of complex information entities which continues to present a challenge for theoretical solution techniques and widely application in Artificial Intelligence and Information Science. In recent years, researchers have focused much on developing new approaches and methods for the service granule problems. This paper utilizes the concept of granule to model the services, as well as using the topological space to map the entireness of services, which explains the cause and framework of service Composition. Therefore, we advance the Clipping Matching Algorithm (CMA) that could be used to reduce the calculate time and complexity of searching services efficiently.