Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
OWLJessKB, http://edge.cs.drexel.edu/assemblies/software/owljesskb/
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)
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)
MONET Consortium. MONET Home Page, Available from http://monet.nag.co.uk
OpenMath Society. OpenMath website, February www, http://www.openmath.org
Richardson, D.: Some Unsolvable Problems Involving Elementary Functions of a Real Variable. Journal of Computational Logic 33, 514–520 (1968)
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)
Sycara, K., Widoff, S., Klusch, M., Lu, J.: Larks: Dynamic matchmaking among heterogeneous software agents in cyberspace. Journal of Autonomous Agents and Multi Agent Systems 5(2), 173–203 (2002)
The GENSS Project. GENSS Home Page, Available from http://genss.cs.bath.ac.uk
The OpenMath Society. The OpenMath Standard (October 2002), Available from http://www.openmath.org/standard/om11/omstd11.xml
Zaremski, A.M., Wing, J.M.: Specification matching of software components. ACM Transactions on Software Engineering and Methodology 6(4), 333–369 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ludwig, S.A., Naylor, W., Rana, O.F., Padget, J. (2006). Matchmaking of Mathematical Web Services. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_97
Download citation
DOI: https://doi.org/10.1007/11752578_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34141-3
Online ISBN: 978-3-540-34142-0
eBook Packages: Computer ScienceComputer Science (R0)