e-Science logo Nesc logo
 
 
About NeSC
e-Science Institute
e-Science Hub
TOE
Contacts
e-Science Events
Resources
Newsroom
Presentations & Lectures
Technical Papers
Global Grid Links
Projects
UK e-Science Centres
UK e-Science Teams
Career Opportunities
Bibliographic Database
 

 

Paper ID: 1629

Matchmaking Support for Mathematical Web Services
Simone A,Ludwig William,Naylor Julian,Padget Omer F,Rana

Appeared in: Proceedings of the UK e-Science All Hands Conference 2005 website: http://www.allhands.org.uk/2005/
Page Numbers:
Publisher: Engineering and Physical Sciences Research Council
Year: 2005
ISBN/ISSN: 1-904425-53-4
Contributing Organisation(s):
Field of Science: e-Science

URL: http://www.allhands.org.uk/2005/proceedings/papers/391.pdf

Abstract: Service discovery and matching-making 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. In this paper, 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-ins that we have implemented. Examples of use are also presented.

Keywords: e-Science, AHM 2005


BIB DOC HTM HTML PDF PPT PS RTF TEX TXT ZIP




 

Last Updated: 22 Jun 12 11:02
This is an archived website, preserved and hosted by the School of Physics and Astronomy at the University of Edinburgh. The School of Physics and Astronomy takes no responsibility for the content, accuracy or freshness of this website. Please email webmaster [at] ph [dot] ed [dot] ac [dot] uk for enquiries about this archive.