Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Proceedings - 1st International Workshop on Linked Web Data Management, LWDM 2011 |
| Seiten | 30-31 |
| Seitenumfang | 2 |
| Publikationsstatus | Veröffentlicht - 2011 |
| Veranstaltung | 1st International Workshop on Linked Web Data Management, LWDM 2011 - Uppsala, Schweden Dauer: 25 März 2011 → 25 März 2011 |
Publikationsreihe
| 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.
ASJC Scopus Sachgebiete
- Informatik (insg.)
- Software
- Informatik (insg.)
- Mensch-Maschine-Interaktion
- Informatik (insg.)
- Maschinelles Sehen und Mustererkennung
- Informatik (insg.)
- Computernetzwerke und -kommunikation
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Proceedings - 1st International Workshop on Linked Web Data Management, LWDM 2011. 2011. S. 30-31 (ACM International Conference Proceeding Series).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › 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 -