Law-governed Linda as a semantics for agent dialogue protocols

ABSTRACT

Tuple spaces and the associated Linda language are a popular model for distributed computation, and Law-Governed Linda (LGL) is a variant allowing processes to have differential and secure access to tuple spaces. We propose a form of LGL as a means of implementing a multi-agent dialogue game protocol, such that utterances under the dialogue protocol are interpreted as actions on particular tuple spaces subject to certain laws. In this way, the tuple spaces, their associated law and the actions on them may be viewed as a semantics for the dialogue protocol syntax.

REFERENCES

• 1: Modeling Dialogues Using Argumentation, Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000), p.31, July 10-12, 2000
• 2: Nicholas Carriero , David Gelernter, Linda in context, Communications of the ACM, v.32 n.4, p.444-458, April 1989 [doi>10.1145/63334.63337]
• 3: David Gelernter, Generative communication in Linda, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.1, p.80-112, Jan. 1985 [doi>10.1145/2363.2433]
• 4: J. P. McGinnis, D. Robertson, and C. Walton. Using distributed protocols as an implementation of dialogue games. In M. d'Inverno et al., editors, EUMAS 2003, Oxford, 2003.
• 5: Naftaly H. Minsky , Jerrold Leichter, Law-Governed Linda as a Coordination Model, Selected papers from the ECOOP'94 Workshop on Models and Languages for Coordination of Parallelism and Distribution, Object-Based Models and Languages for Concurrent Systems, p.125-146, July 05, 1994
• 6: Henry Prakken, On Dialogue Systems with Speech Acts, Arguments, and Counterarguments, Proceedings of the European Workshop on Logics in Artificial Intelligence, p.224-238, October 02, 2000
• 7: W. Vasconcelos , D. Robertson , C. Sierra , M. Esteva , J. Sabater , M. Wooldridge, Rapid Prototyping of Large Multi-Agent Systems Through Logic Programming, Annals of Mathematics and Artificial Intelligence, v.41 n.2-4, p.135-169, August 2004 [doi>10.1023/B:AMAI.0000031194.57352.e7]

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.1 Models of Computation
          Subjects: Relations between models

General Terms:
Languages

Keywords:
dialogue, semantics