Behaviour approach for composite OWL-S services discovery

摘要

Service discovery is the process of retrieving the service most similar to the query based on the description of functional and/or non-functional semantics. The matchmaking based only on service profile (inputs/outputs) is not sufficient in the case of composite services, to overcome profile matching limitations, we propose an approach-based subgraph isomorphism to check the matching of process structure between two OWL-S process models of composite services and shortest path (OWLS-SP) to compute the score of matching between nodes of service and query (atomic services).