A flexible graph-based approach for matching composite semantic web services

Alfredo Cuzzocrea, Marco Fisichella · 2011

In this paper, we propose a flexible graph-based approach for matching composite Semantic Web services that are semantically described by OWL-S. To this end, we introduce an innovative framework that performs matches at both the atomic and structural level of services, and retrieves ranked lists of advertise services that can be used to compose complex Semantic Web services from basic ones.

Read the paper · More papers on PaperTik