Details
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 1st International Workshop on Linked Web Data Management, LWDM 2011 |
| Pages | 30-31 |
| Number of pages | 2 |
| Publication status | Published - 2011 |
| Event | 1st International Workshop on Linked Web Data Management, LWDM 2011 - Uppsala, Sweden Duration: 25 Mar 2011 → 25 Mar 2011 |
Publication series
| Name | ACM International Conference Proceeding Series |
|---|
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.
Keywords
- Matching Semantic Web services, OWL-S, Semantic Web
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Computer Science(all)
- Human-Computer Interaction
- Computer Science(all)
- Computer Vision and Pattern Recognition
- Computer Science(all)
- Computer Networks and Communications
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Proceedings - 1st International Workshop on Linked Web Data Management, LWDM 2011. 2011. p. 30-31 (ACM International Conference Proceeding Series).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - A flexible graph-based approach for matching composite Semantic Web services
AU - Cuzzocrea, Alfredo
AU - Fisichella, Marco
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - Matching Semantic Web services
KW - OWL-S
KW - Semantic Web
UR - http://www.scopus.com/inward/record.url?scp=79956040240&partnerID=8YFLogxK
U2 - 10.1145/1966901.1966910
DO - 10.1145/1966901.1966910
M3 - Conference contribution
AN - SCOPUS:79956040240
SN - 9781450306089
T3 - ACM International Conference Proceeding Series
SP - 30
EP - 31
BT - Proceedings - 1st International Workshop on Linked Web Data Management, LWDM 2011
T2 - 1st International Workshop on Linked Web Data Management, LWDM 2011
Y2 - 25 March 2011 through 25 March 2011
ER -