Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Law-Governed Linda as a Coordination Model
ECOOP '94 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
Modeling Dialogues Using Argumentation
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Rapid Prototyping of Large Multi-Agent Systems Through Logic Programming
Annals of Mathematics and Artificial Intelligence
Towards a multi-agent system for regulated information exchange in crime investigations
Artificial Intelligence and Law - Argumentation in artificial intelligence and law
An implementation of norm-based agent negotiation
Proceedings of the 11th international conference on Artificial intelligence and law
Arguing for gaining access to information
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Argumentation in Multi-Agent Systems
Argumentation and Artifact for Dialogue Support
Argumentation in Multi-Agent Systems
Co-argumentation artifact for agent societies
ArgMAS'07 Proceedings of the 4th international conference on Argumentation in multi-agent systems
| Hi-index | 0.00 |
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.