Matchmaking of Mathematical Web Services
Service discovery and matchmaking in a distributed environment has been an active research issue since at least the mid 1990s. Previous work on matchmaking has typically presented the problem and service descriptions as free or structured (marked-up) text, so that keyword searches, tree-matching or simple constraint solving are sufficient to identify matches. We discuss the problem of matchmaking for mathematical services, where the semantics play a critical role in determining the applicability or otherwise of a service and for which we use OpenMath descriptions of pre and post-conditions. We describe a matchmaking architecture supporting the use of match plug-ins and describe four kinds of plug-in that we have developed to date.
Unable to display preview. Download preview PDF.
- 2.Gomez, M., Plaza, E.: Extended matchmaking to maximize capability reuse. In: Jennings, N.R., et al. (eds.) Proceedings of The Third International Joint Conference on Autonomous Agents and Multi Agent Systems, vol. 1, pp. 144–151. ACM Press, New York (2004)Google Scholar
- 3.Bohrer, W., Nodine, M., Ngu, A.H.: Semantic brokering over dynamic heterogenous data sources in infosleuth. In: Proceedings of the 15th International Conference on Data Engineering, pp. 358–365 (1999)Google Scholar
- 4.MONET Consortium. MONET Home Page, Available from http://monet.nag.co.uk
- 5.OpenMath Society. OpenMath website, February www, http://www.openmath.org
- 7.Sowa, J.F.: Ontology, metadata, and semiotics, conceptual structures: Logical, linguistic, and computational issues. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, Springer, Heidelberg (2000)Google Scholar
- 9.The GENSS Project. GENSS Home Page, Available from http://genss.cs.bath.ac.uk
- 10.The OpenMath Society. The OpenMath Standard (October 2002), Available from http://www.openmath.org/standard/om11/omstd11.xml