Matchmaking of mathematical web services

Authors:
Simone A. Ludwig;William Naylor;Omer F. Rana;Julian Padget
Affiliations:
Department of Computer Science, Cardiff University, UK;Department of Computer Science, University of Bath, UK;Department of Computer Science, Cardiff University, UK;Department of Computer Science, University of Bath, UK
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 5
Cited 1

Specification matching of software components

ACM Transactions on Software Engineering and Methodology (TOSEM)
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace

Autonomous Agents and Multi-Agent Systems
Ontology, Metadata, and Semiotics

ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Semantic Brokering over Dynamic Heterogeneous Data Sources in InfoSleuth(tm)

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Extending Matchmaking to Maximize Capability Reuse

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1

Comparing semantic registries: OWLJessKB and InstanceStore

Proceedings of the 2007 workshop on Service-oriented computing performance: aspects, issues, and approaches

Quantified Score

Hi-index	0.00

Visualization

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.