Agent-based matchmaking of mathematical web services

Ludwig, Simone A., Rana, Omer Farooq ORCID: https://orcid.org/0000-0003-3597-2646, Naylor, William and Padget, Julian 2005. Agent-based matchmaking of mathematical web services. Presented at: Fourth international joint conference on Autonomous agents and multiagent systems, Utrecht, The Netherlands, 25-29 July 2005, Utrecht, Netherlands, 25-29 July 2005. Published in: Pechoucek, M., Steiner, D. and Thompson, S. eds. AAMAS '05: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems. New York, NY: ACM, pp. 1277-1278. 10.1145/1082473.1082731

Full text not available from this repository.

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.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Publisher:	ACM
ISBN:	1595930930
Last Modified:	24 Oct 2022 10:20
URI:	https://orca.cardiff.ac.uk/id/eprint/43964

Citation Data

Actions (repository staff only)

Edit Item