Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Matchmaking of mathematical web services

Ludwig, Simone Anja, Naylor, William, Rana, Omer Farooq and Padget, Julian 2006. Matchmaking of mathematical web services. Lecture Notes in Computer Science 3911 , pp. 809-816. 10.1007/11752578_97

Full text not available from this repository.


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

Item Type: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA76 Computer software
Publisher: Springer
ISSN: 0302-9743
Last Modified: 04 Jun 2017 04:44

Citation Data

Actions (repository staff only)

Edit Item Edit Item