Abstract
In this paper we describe an approach to the representation and implementation of agent-based systems where the behaviour of an individual agent is represented by a set of logical rules in a particular form. This not only provides a logical specification of the agent, but also allows us to directly execute the rules in order to implement the agent's behaviour. Agents communicate with each other through a simple, and logically well-founded, broadcast communication mechanism. In addition, agents can be grouped together. This not only restricts the extent of broadcast messages, but also provides a structuring mechanism within the agent space.
The purpose of this paper is threefold: to motivate the use of our particular computational model; to show that a logic-based approach is both possible and potentially very powerful; and to assert that by narrowing the gap between the agent theory and the agent programming language, we are able to bring the prospect of formal specification and verification of multi-agent systems nearer.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8: 277–295, 1989.
G. Agha. Actors — A Model for Concurrent Computation in Distributed Systems. MIT Press, 1986.
H. Barringer, R. Kuiper, and A. Pnueli. A Really Abstract Concurrent Model and its Temporal Logic. In Proceedings of the Thirteenth ACM Symposium on the Principles of Programming Languages, St. Petersberg Beach, Florida, 1986.
K. Birman and T. Joseph. Reliable Communication in the Presence of Failures. ACM Transactions on Computer Systems, 5(1):47–76, February 1987.
K. Birman. The Process Group Approach to Reliable Distributed Computing. Techanical Report TR91-1216, Department of Computer Science, Cornell University, July 1991.
A. Borg, J. Baumbach, and S. Glazer. A Message System Supporting Fault Tolerance. In Proceedings of the Ninth ACM Symposium on Operating System Principles, New Hampshire, October 1983. ACM. (In ACM Operating Systems Review, vol. 17, no. 5).
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.
M. Finger, M. Fisher, and R. Owens. MetateM at Work: Modelling Reactive Systems Using Executable Temporal Logic. In Sixth International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE-93), Edinburgh, U.K., June 1993. Gordon and Breach Publishers.
M. Fisher. A Survey of Concurrent MetateM — The Language and its Applications. In First International Conference on Temporal Logic (ICTL), July 1994.
M. Fisher. Towards a Semantics for Concurrent MetateM. In M. Fisher and R. Owens, editors, Executable Modal and Temporal Logics. Springer-Verlag, 1995.
M. Fisher and M. Wooldridge. A Logical Approach to the Representation of Societies of Agents. In N. Gilbert and J. Doran, editors, Artificial Societies. UCL Press Ltd, London, 1995.
M. Fisher and M. Wooldridge. Specifying and Verifying Distributed Intelligent Systems. In Portuguese Conference on Artificial Intelligence (EPIA). Springer-Verlag, October 1993.
M. Fisher. A Resolution Method for Temporal Logic. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia, August 1991. Morgan Kaufman.
W. D. Hillis. The Connection Machine: A computer architecture based on cellular automata. Physica D, 10:213–228, 1984.
W. D. Hillis and G. L. Steele. Data parallel algorithms. Comm. ACM, 29(12):1170–1183, December 1986.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1992.
T. Maruichi, M. Ichikawa, and M. Tokoro. Modelling Autonomous Agents and their Groups. In Y. Demazeau and J. P. Muller, editors, Decentralized AI 2 — Proceedings of the 2 nd European Workshop on Modelling Autonomous Agents and Multi-Agent Worlds (MAAMAW '90). Elsevier/North Holland, 1991.
F. McCabe and K. Clark. April — agent process interaction language. (In this volume.)
R. M. Metcalfe and D. R. Boggs. Ethernet: Distributed Packet Switching for Local Computer Networks. Comm. ACM, 7(19), July 1976.
Y. Shoham. Agent-Oriented Programming. Artificial Intelligence, 60(1):51–92, 1993.
R. G. Smith. A Framework for Distributed Problem Solving. UMI Research Press, 1980.
A. Szalas and L. Holenderski. Incompleteness of First-Order Temporal Logic with Until. Theoretical Computer Science, 57:317–325, 1988.
S. R. Thomas. The PLACA Agent Programming Language. (In this volume.)
D. Weerasooriya, A. Rao, and K. Ramamohanarao. Design of a Concurrent Agent-Oriented Language. (In this volume.)
M. Wooldridge and N. Jennings. Agent Theories, Architectures and Languages: A Survey. (In this volume.)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fisher, M. (1995). Representing and executing agent-based systems. In: Wooldridge, M.J., Jennings, N.R. (eds) Intelligent Agents. ATAL 1994. Lecture Notes in Computer Science, vol 890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58855-8_20
Download citation
DOI: https://doi.org/10.1007/3-540-58855-8_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58855-9
Online ISBN: 978-3-540-49129-3
eBook Packages: Springer Book Archive