A flexible graph-based approach for matching composite Semantic Web services

Conference Paper
Publication Date:
2011
abstract:
In this paper, we propose a exible 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. Copyright 2011 ACM.
Iris type:
04.01 Contributo in Atti di convegno
Keywords:
Matching Semantic Web services; OWL-S; Semantic Web
List of contributors:
Handle:
https://iris.cnr.it/handle/20.500.14243/282720
Book title:
Proceedings of the 2011 EDBT/ICDT Workshop on Linked Web Data Management, Uppsala, Sweden, March 25, 2011