Derivation of Glue Code for Agent Interoperation

  • Authors:

  • Drew Mcdermott;Mark Burstein;Douglas R. Smith;Stephen J. Westfold

  • Affiliations:

  • Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT 06520 mcdermott@cs.yale.edu;BBN Technologies, 10 Moulton Street, Cambridge MA 02138 burstein@bbn.com;Kestrel Institute, 3260 Hillview Avenue, Palo Alto, CA 94304 smith@kestrel.edu;Kestrel Institute, 3260 Hillview Avenue, Palo Alto, CA 94304 westfold@kestrel.edu

  • Venue:
  • Autonomous Agents and Multi-Agent Systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Getting agents to communicate requires translating the data structures of the sender (the source representation) to the format required by the receiver (the target representation). Assuming that there is a formal theory of the semantics of the two formats, which explains both their meanings in terms of a neutral topic domain, we can cast the translation problem as solving higher-order functional equations. Some simple rules and strategies apparently suffice to solve these equations automatically. The strategies may be summarized as: decompose complex expressions, replacing topic-domain expressions with source-domain expressions when necessary. A crucial issue is getting the required formal theories of the source and target domains. We believe it is sufficient to find partial formalizations that grow as necessary.