Abstract
We consider the problem of defining executable runs for classes of communicating agents. We first define an abstract machine that generates runs for individual agents with non-deterministic plans. We then introduce agent classes whose communication primitives are based on deduction. While current communication models are overly expressive with respect to the core agent models that are used as background theory, communicating agents based on deduction achieve a balanced integration. Contrary to other more theoretical work, their operational semantics are given by an abstract machine that is defined purely in sequential terms. This machine readily offers straightforward opportunities for implementing and experimenting prototypes of collaborative agents.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Bonzon, Compiling Agent Dialogs for Simple Sequential Execution, submitted
G. de Giacomo, Y. Lespérance and H. Levesque, ConGolog, a Concurrent Programming Language Based on the Situation Calculus, Artificial Intelligence, vol. 121(2000)
G. de Giacomo and H. Levesque, An Incremental Interpreter for High-Level Programs with Sensing, in: H. Levesque & F. Pirri (eds), Logical Foundations for Cognitive Agents, Springer (2000)
R. Fagin, J. Halpern, Y Moses & M. Vardi, Reasoning About Knowledge, MIT Press (1995)
Ferber & O. Gutknecht, Operational Semantics of Multi-agent Organizations, in: N.R. Jennings and Y. Lespérance (eds), Intelligent Agents VI, LNAI, vol. 1757, Springer (2000)
K.V. Hindriks, F.S. de Boer, W. van der Hoek and J.-J. Meyer, Semantics of Communicating Agents Based on Deduction and Abduction, Proceedings IJCAI99 Workshop on ACL (1999)
Y. Lespérance, K. Tam and M. Jenkin, Reactivity in a Logic-Based Robot Programming Framework, in: N.R. Jennings and Y. Lespérance (eds), Intelligent Agents VI, LNAI, vol. 1757, Springer (2000)
H.J. Levesque, R. Reiter, Y. Lespérance, F. Lin & R. Scherl, GOLOG: A Logic Programming Language for Dynamic Domains, Journal of Logic Programming, vol. 31 (1997)
R. Milner, Communicating and Mobile Systems; the π-Calculus, Cambridge Univ. Press (1999)
A.S. Rao, AgentSpeak(L): BDI Agents Speak Out in a Logical Computable Language, in: W. Van der Velde and J.W. Perram (eds.), Agents Breaking Away (MAAMAW’ 96), LNAI vol. 1038, Springer (1996)
R. Searle, Speech Acts, Cambridge University Press (1969)
M. Wooldridge, Reasoning about Rational Agents, MIT Press (2000)
Reasoning about Visibility, Perception and Knowledge, in: N.R. Jennings and Y. Lespérance (eds), Intelligent Agents VI, LNAI,vol. 1757, Springer (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonzon, P. (2002). An Abstract Machine for Classes of Communicating Agents Based on Deduction. In: Meyer, JJ.C., Tambe, M. (eds) Intelligent Agents VIII. ATAL 2001. Lecture Notes in Computer Science(), vol 2333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45448-9_15
Download citation
DOI: https://doi.org/10.1007/3-540-45448-9_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43858-8
Online ISBN: 978-3-540-45448-9
eBook Packages: Springer Book Archive