Agent-based matchmaking of mathematical web services

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 preand post-conditions. We describe a matchmaking architecture supporting the use of match plug-ins.

• Type: Conference
• Year: 2005
• Where: ATAL
• Authors: Simone A. Ludwig, Omer F. Rana, William Naylor, Julian A. Padget
• Keywords: Active Research Issue, ATAL 2005, Intelligent Agents, Matchmaking, Matchmaking Architecture