LARKS: Dynamic Matchmaking Among Heterogeneous Software Agents in CyberspaceK. Sycara; S. Widoff; Matthias Klusch; J. Lu
In: J. S. Rosenschein; P. Stone (Hrsg.). International Journal on Autonomous Agents and Multi-Agent Systems (JAAMAS), Vol. 5, Pages 173-203, Kluwer Academic Press, 2002.
Service matchmaking among heterogeneous software agents in the Internet is usually done dynamically and must be efficient. There is an obvious trade-off between the quality and efficiency of matchmaking on the Internet. We define a language called Larks for agent advertisements and requests, and present a flexible and efficient matchmaking process that uses Larks. The Larks matchmaking process performs both syntactic and semantic matching, and in addition allows the specification of concepts (local ontologies) via ITL, a concept language. The matching process uses five different filters: context matching, profile comparison, similarity matching, signature matching and constraint matching. Different degrees of partial matching can result from utilizing different combinations of these filters. We briefly report on our implementation of Larks and the matchmaking process in Java. Fielded applications of matchmaking using Larks in several application domains for systems of information agents are ongoing efforts.