Matchmaking framework for mathematical web services

Ludwig, Simone A., Rana, Omer Farooq ORCID: https://orcid.org/0000-0003-3597-2646, Padget, Julian and Naylor, William 2006. Matchmaking framework for mathematical web services. Journal of Grid Computing 4 (1) , pp. 33-48. 10.1007/s10723-005-9019-z

Full text not available from this repository.

Abstract

Service discovery and matchmaking in a distributed environment has been an active research issue for some time now. 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 five kinds of plug-in that we have developed to date: (i) A basic structural match, (ii) a syntax and ontology match, (iii) a value substitution match, (iv) an algebraic equivalence match and (v) a decomposition match. The matchmaker uses the individual match scores from the plug-ins to compute a ranking by applicability of the services. We consider the effect of pre- and post-conditions of mathematical service descriptions on matching, and how and why to reduce queries into Disjunctive Normal Form (DNF) before matching. A case study demonstrates in detail how the matching process works for all four algorithms.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Schools > Computer Science & Informatics Schools > Lifelong Learning
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Springer
ISSN:	15729814
Last Modified:	17 Oct 2022 09:02
URI:	https://orca.cardiff.ac.uk/id/eprint/1868

Citation Data

Cited 16 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item