Scalable Matchmaking for WSMO Web Services
Eyal Oren Andreas Harth
20th April 2004
automatic composition is not interesting (let alone possible), support for semi-
automatic composition is interesting
we will use the paper by lei & horrocks and the oom paper
we will do matchmaking on WSMO goals and capabilities
problems with OOM: not (completely) scalable, since it reasons with all grid
we will translate query into representations used by diﬀerent (RDQL or other
logical) datastores, and distribute the query among them. this is 1) scalable and
2) allow to talk to diﬀerent datastores using diﬀerent protocols
the translations between the query ontology and the (diﬀerent) datastore
ontology will be done by our implementation of OO-mediators.
we could crawl existing web services by using an extension of the default
nonfunctional properties of web services. we can deﬁne a ¡rdf:seeAlso¿ nonfunc-
tional property that refers to other web services. using this we can crawl the
web to collect possible web services.
where will the ontology used by the goal, and the ontology used by the diﬀerent
capabilities ﬁt in / be mediated ?