Knowledge services dynamic composition algorithm based on semantics

According to the knowledge services dynamic composition problems, a knowledge services matching algorithm is proposed based on semantic, which defines the degree of matching as a real number between 0 and 1. The reverse matching strategy starts from the users' output parameters, and according to the matching degree, finds out the sort service list that fits the requirements, finally realizes the dynamic services composition. The public transportation instance verifies the correctness and accuracy of this algorithm.