Composition-oriented service discovery

被引:0
作者
Brogi, A [1 ]
Corfini, S [1 ]
Popescu, R [1 ]
机构
[1] Univ Pisa, Dept Comp Sci, Pisa, Italy
来源
SOFTWARE COMPOSITION | 2005年 / 3628卷
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Service discovery and service aggregation are two crucial issues in the emerging area of Service-oriented Computing (SoC). We propose a new technique for the discovery of (Web) services that accounts for the need of composing several services to satisfy a client query. The proposed algorithm makes use of OWL-S ontologies, and explicitly returns the sequence of atomic process invocations that the client must perform in order to achieve the desired result. When no full match is possible, the algorithm features a flexible matching by returning partial matches and by suggesting additional inputs that would produce a full match.
引用
收藏
页码:15 / 30
页数:16
相关论文
共 14 条
[1]  
[Anonymous], WEB SERV DESCR LANG
[2]   An algorithm for Web service discovery through their composition [J].
Aversano, L ;
Canfora, G ;
Ciampi, A .
IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS, 2004, :332-339
[3]  
BANSAL S, 2002, THESIS U S CAROLINA
[4]  
BANSAL S, 2003, 2 INT JOINT C AUT AG, P926
[5]   A formal approach to component adaptation [J].
Bracciali, A ;
Brogi, A ;
Canal, C .
JOURNAL OF SYSTEMS AND SOFTWARE, 2005, 74 (01) :45-54
[6]  
BROGI A, 2004, ICSOC 2004 P NOV
[7]  
Kawamura T, 2004, LECT NOTES COMPUT SC, V3298, P752
[8]  
*OWL S COAL, OWL S 1 1 REL
[9]  
Paolucci M, 2002, LECT NOTES COMPUT SC, V2342, P333
[10]  
Papazoglou MP, 2003, COMMUN ACM, V46, P25, DOI 10.1145/944217.944233