Skip to main content
SpringerLink
Log in

Temporal Development Methods for Agent-Based

  • Published:
Autonomous Agents and Multi-Agent Systems Aims and scope Submit manuscript

Abstract

In this paper we overview one specific approach to the formal development of multi-agent systems. This approach is based on the use of temporal logics to represent both the behaviour of individual agents, and the macro-level behaviour of multi-agent systems. We describe how formal specification, verification and refinement can all be developed using this temporal basis, and how implementation can be achieved by directly executing these formal representations. We also show how the basic framework can be extended in various ways to handle the representation and implementation of agents capable of more complex deliberation and reasoning.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. H. Barringer, M. Fisher, D. Gabbay, G. Gough, and R. Owens, “METATEM: An introduction,” Formal Aspects Comput., vol. 7, no.5, pp. 533–549, 1995.

    Article  Google Scholar 

  2. H. Barringer, M. Fisher, D. Gabbay, R. Owens, and M. Reynolds (eds.), The Imperative Future: Principles of Executable Temporal Logics, Research Studies Press: Chichester, United Kingdom, 1996.

    Google Scholar 

  3. 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.

  4. P. Blackburn and M. de Rijke, “Why combine logics?,” Studia Logica, vol. 59, pp. 5–27, 1997.

    Article  Google Scholar 

  5. A. Bolotov and M. Fisher, “A clausal resolution method for CTL branching-time temporal logic,” J. Exp. Theor. Artif. Intel., vol. 11, pp. 77–93, 1999.

    Article  Google Scholar 

  6. J. Bradshaw, M. Greaves, H. Holmback, T. Karygiannis, B. Silverman, N. Suri, and A. Wong, “Agents for the masses?,” EEE Intell. Syst., vol. 14, no.2, pp. 53–63, 1999.

    Article  Google Scholar 

  7. M. E. Bratman, “What is intention?,” in P. R. Cohen, J. L. Morgan, and M. E. Pollack (eds.), Intentions in Communication, The MIT Press: Cambridge, MA, 1990, pp. 15–32.

    Google Scholar 

  8. M. Dastani, F. de Boer, F. Dignum, and J.J. Meyer, “Programming agent deliberation: An approach illustrated using the 3APL language,” in Proceedings of the Second International Conference on Autonomous Agents and Multiagent Systems (AAMAS ‘03), Melbourne, July 2003, ACM Press 2003.

  9. A. Degtyarev, M. Fisher, and B. Konev, “Monodic temporal resolution,” in Proceedings of the CADE-19. Available as Technical report ULCS-03-001 from http://www.csc.liv.ac.uk/research/, 2003.

  10. C. Dixon, “Temporal resolution using a Breadth-First Search Algorithm,” Ann. Math. Artif. Intel., vol. 22, pp. 87–115, 1998.

    Article  Google Scholar 

  11. C. Dixon and M. Fisher,“Clausal resolution for logics of time and knowledge with synchrony and perfect recall,” in Proceedings of Joint International Conference on Temporal Logic and Advances in Modal Logic (AiML-ICTL), Leipzig, Germany, 2000.

  12. C. Dixon, M. Fisher, and A. Bolotov,“Resolution in a logic of rational agency,” Artif. Intell. (Elsevier Science) vol.139, no.1, pp.47–89, 2002.

    Article  Google Scholar 

  13. C. Dixon, M. Fisher, and M. Wooldridge, “Resolution for temporal logics of knowledge,” J. Logic Comput., vol. 8, no.3, pp. 345–372, 1998.

    Article  Google Scholar 

  14. E. A. Emerson, “Temporal and modal logic,” in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Elsevier, 1990, pp. 996–1072.

  15. R. Fagin, J. Halpern, Y. Moses, and M. Vardi, Reasoning About Knowledge, MIT Press, 1996.

  16. M. Fisher, “A resolution method for temporal logic,” in Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia, 1991.

  17. M. Fisher, “A survey of concurrent METATEM–the language and its applications,” in First International Conference on Temporal Logic (ICTL), Bonn, Germany. (Published in Lecture Notes in Computer Science, vol. 827, Springer-Verlag), 1994.

  18. M. Fisher, “Representing and executing agent-based systems,” in M. Wooldridge and N. R. Jennings (eds.), Intelligent Agents, 1995.

  19. M. Fisher, “A temporal semantics for concurrent METATEM,” J. Symb. Comput., vol. 22, no.5/6, pp. 627–648, 1996a.

    Article  MathSciNet  Google Scholar 

  20. M. Fisher, “An introduction to executable temporal logics,” Knowl. Eng. Rev., vol. 11, no.1, pp. 43–56, 1996b.

    Google Scholar 

  21. M. Fisher, “A normal form for temporal logic and its application in theorem-proving and execution,” J. Logic Comput., vol. 7, no.4, 1997a.

  22. M. Fisher, “An open approach to concurrent theorem-proving,” in J. Geller, H. Kitano, and C. Suttner (eds.), Parallel Processing for Artificial Intelligence, Elsevier /North-Holland, vol. 3, 1997b.

    Google Scholar 

  23. M. Fisher, “Implementing BDI-like systems by direct execution,” in Proceedings of International Joint Conference on Artificial Intelligence (IJCA1), 1997c.

  24. M. Fisher, “Towards the refinement of executable temporal objects,” in H. Bowman and J. Derrick (eds.), Formal Methods for Open Object-Based Distributed Systems, 1997d.

  25. M. Fisher, “Representing abstract agent architectures,” in J. P. Mu¨ ller, M. P. Singh, and A. S. Rao (eds.), Intelligent Agents V–Proceedings of the Fifth International Workshop on Agent Theories, Architectures, and Languages (ATAL-98), Lecture Notes in Artificial Intelligence, Springer-Verlag: Heidelberg, 1996.

    Google Scholar 

  26. M. Fisher, C. Dixon, and M. Peim, “Clausal temporal resolution,” ACM Trans. Comput. Logic, vol. 2, no. 1, pp. 12–56, 2001.

    Article  Google Scholar 

  27. M. Fisher and C. Ghidini, “Programming resource-bounded deliberative agents,” in Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 1999.

  28. M. Fisher and C. Ghidini, “Agents playing with dynamic resource bounds,” in ECAI Workshop on Balancing Reactivity and Social Deliberation in Multi-Agent Systems, Berlin, Germany, 2000a.

  29. M. Fisher and C. Ghidini, “Specifying and implementing agents with dynamic resource bounds,” in Proceedings of ECAI-2000 Workshop on Cognitive Robotics, 2000b.

  30. M. Fisher and T. Kakoudakis, “Flexible agent grouping in executable temporal logic,” in Proceedings of Twelfth International Symposium on Languages for Intensional Programming (ISLIP), 1999.

  31. B. Hirsch, M. Fisher, and C. Ghidini, “Organising logic-based agents,” in Proceedings of the Second NASA/IEEE Goddard Workshop on Formal Approaches to Agent-Based Systems (FAABS-II), Greenbelt, Maryland, October 2002.

  32. M. Fisher and A. Kellett, “Programming dynamic multi-agent systems,” in Proceedings of the UK Intelligent Agents Workshop, Oxford, 1997.

  33. M. Fisher and R. Owens, “From the past to the future: Executing temporal logic programs,” in Proceedings of Logic Programming and Automated Reasoning (LPAR), St. Petersberg, Russia. (Published in Lecture Notes in Computer Science, Springer-Verlag), vol. 624, 1992.

  34. M. Fisher and M. Wooldridge, “On the formal specification and verification of multi-agent systems,” Int. J. Coop. Inform. Syst., vol. 6, no.1, pp. 37–65, 1997.

    Article  Google Scholar 

  35. M. Fisher, M. Wooldridge, and C. Dixon, “A resolution-based proof method for temporal logics of knowledge and belief,” in Proceedings of the International Conference on Formal and Applied Practical Reasoning (FAPR), Bonn, Germany, 1996.

  36. S. Franklin and A. Graesser, “Is it an agent, or just a program? A taxonomy for autonomous agents,” in J. P. Mu¨ ller, M. J. Wooldridge, and N. R. Jennings (eds.), Intelligent Agents III–Proceedings of the Third International Workshop on Agent Theories, Architectures, and Languages (ATAL-96), Lecture Notes in Artificial Intelligence, Springer-Verlag: Heidelberg, 1996.

    Google Scholar 

  37. J. Y. Halpern and M. Y. Vardi, “Model checking vs. theorem proving: A manifesto,” in V. Lifschitz (ed.), AI and Mathematical Theory of Computation–Papers in Honor of John McCarthy, Academic Press, 1991.

  38. D. Harel, D. Kozen, and J. Tiuryn, Dynamic Logic, MIT Press: Cambridge, MA, USA, 2000.

    Google Scholar 

  39. K. Hindriks, F. de Boer, W. van der Hoek, and J.-J. Meyer, ‘Formal semantics for an abstract agent programming language,” in Intelligent Agents IV: Proceedings of the Fourth International Workshop on Agent Theories, Architectures and Languages, Vol. 1365 of Lecture Notes in Artificial Intelligence, 1998 pp. 215–229.

    Google Scholar 

  40. K. Hindriks, F. de Boer, W. van der Hoek, and J.-J. Meyer, “Agent programming with declarative goals,” in C. Castelfranchi and Y. Lesperance (eds.), Intelligent Agents VII, Proceedings of the 6th Workshop on Agent Theories, Architectures, and Languages (ATAL), Vol. of Lecture Notes in Artificial Intelligence, 2001, pp. 228–243.

  41. G. Holzmann, “The model checker spin,” IEEE Trans. Software Eng., vol. 23, no.5, pp. 279–295,1997. Special issue on Formal Methods in Software Practice.

    Article  Google Scholar 

  42. U. Hustadt, C. Dixon, R. Schmidt, J.-J. M. M. Fisher, and W. van der Hoek, “Verification within the KARO agent theory,” in Proceedings of the First Goddard Workshop on Formal Approaches to Agent-Based Systems, Goddard Space Flight Center, Greenbelt, Maryland, USA. Lecture Notes in Computer Science, Springer-Verlag, 2000a.

  43. U. Hustadt, C. Dixon, R. A. Schmidt, and M. Fisher, “Normal forms and proofs in combined modal and temporal logics,” in Proceedings of the Third International Workshop on Frontiers of Combining Systems (FroCoS’2000), Vol. 1794 of Lecture Notes in Artificial Intelligence, 2000b.

  44. U. Hustadt, C. Dixon, R. A. Schmidt, M. Fisher, J.-J. Meyer, and W. van der Hoek, “Reasoning about agents in the KARO framework,” in C. Bettini and A. Montanari (eds.), Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME-01), Cividale del Friuli, Italy, pp. 206–213, 2001.

  45. N. R. Jennings and M. Wooldridge, “Applications of agent technology,” in Agent Technology: Foundations, Applications, and Markets, Springer-Verlag: Heidelberg, 1998.

    Google Scholar 

  46. A. Kellett, “Implementation techniques for concurrent METATEM,” Ph.D. thesis, Department of Computing and Mathematics, Manchester Metropolitan University, 2000.

    Google Scholar 

  47. A. Kellett and M. Fisher, “Automata representations for concurrent METATEM,” in Proceedings of the Fourth International Workshop on Temporal Representation and Reasoning (TIME), 1997a.

  48. A. Kellett and M. Fisher, “Concurrent METATEM as a coordination language,” in Coordination Languages and Models (LNCS 1282), 1997b.

  49. Y. Kesten, Z. Manna, and A. Pnueli, “Temporal verification of simulation and refinement,” Lect. Notes Comput. Sci., vol. 803, pp. 273–346, 1994.

    Google Scholar 

  50. H. Levesque, R. Reiter, Y. Lespe’ rance, F. Lin, and R. Scherl, “GOLOG: A logic programming language for dynamic domains,” J. Logic Prog., vol. 31, pp. 59–84, 1997.

    Article  MathSciNet  Google Scholar 

  51. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, Springer-Verlag: New York, 1992.

    Google Scholar 

  52. J. McCarthy and P. J. Hayes, “Some philosophical problems from the standpoint of artificial intelligence,” in B. Meltzer and D. Michie (eds.), Machine Intelligence 4, Edinburgh University Press, 1969.

  53. A. Mili, J. Desharnais, and J. R. Gagne’,“Formal models of stepwise refinements of programs,”ACM Comput. Surv., vol.18, no.3, pp.231–276, 1986.

    Article  MathSciNet  Google Scholar 

  54. N. Muscettola, P. P. Nayak, B. Pell, and B. Williams, “Remote agent: To boldly go where no AI system has gone before,” Artif. Intel., vol. 103, nos. 1–2, pp. 5–48, 1998.

    Article  Google Scholar 

  55. H. J. Ohlbach, “Translation methods for non-classical logics–an overview,” J. IGPL, vol. 1, no.1, pp. 69–90, 1993.

    Google Scholar 

  56. A. Pnueli, “The temporal semantics of concurrent programs,” Theor. Comput. Sci., vol. 13, pp. 45–60,1981.

    Article  Google Scholar 

  57. A. Pnueli and R. Rosner, “On the synthesis of a reactive module,” in Proceedings of the 16th ACM Symposium on the Principles of Programming Languages, 1989, pp. 179–190.

  58. A. Rao, “AgentSpeak(L): BD1 agents speak out in a logical computable language,” in W. Van de Velde and J. Perram (eds.), Agents Breaking Away–Proceedings of the Seventh European Workshop on Modelling Autonomous Agents in a Multi-Agent World, MAAMAW-96 (LNA1 1038), 1996a, pp. 42–55.

  59. A. S. Rao, “Decision procedures for prepositional linear-time belief-desire-intention logics,” in M. Wooldridge, J. P. Mu¨ ller, and M. Tambe (eds.), Intelligent Agents II (LNAI 1037), Springer-Verlag: Heidelberg, Germany, 1996b, pp. 33–48.

    Google Scholar 

  60. A. S. Rao and M. Georgeff, “BDI agents: From theory to practice,” in Proceedings of the First International Conference on Multi-Agent Systems (ICMAS-95), San Francisco, CA, 1995, pp. 312–319.

  61. A. S. Rao and M. P. Georgeff, “Modeling agents within a BDI-architecture,” in R. Fikes and E. Sandewall (eds.), International Conference on Principles of Knowledge Representation and Reasoning (KR), Cambridge, Massachusetts, 1991.

  62. S. Shapiro, Y. Lespe’ rance, and H. Levesque, “Agents for expertise location,” in W. Wobeke, M. Pagnucco, and C. Zhang (eds.), Agents and Multi-Agent Systems–Formalisms, Methodologies, and Applications, Springer-Verlag: Heidelberg, Germany, 1998.

    Google Scholar 

  63. B. van Linder, W. van der Hoek, and J. J. C. Meyer, “How to motivate your agents,” in M. Wooldridge, J. P. Mu¨ ller, and M. Tambe (eds.), Intelligent Agents 11 (LNAI 1037), Springer-Verlag: Heidelberg, Germany, 1996, pp. 17–32.

    Google Scholar 

  64. B. van Riemsdijk, W. van der Hoek, and J.-J. Meyer, “Agent programming in dribble: From beliefs to goals with plans,” in J. Rosenschein, T. Sandholm, M. Wooldridge, and M. Yokoo (eds.), Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2002, pp. 393–400.

  65. M. Y. Vardi, “A temporal fixpoint calculus,” in Proceedings of the Fifteenth ACM Symposium on the Principles of Programming Languages, San Diego, California (Extended Abstract), 1988, pp. 250–259.

  66. M. Wooldridge, C. Dixon, and M. Fisher, “A tableau-based proof method for temporal logics of knowledge and belief,” J. Appl. Non-Classical Logics, vol. 8, no.3, pp. 225–258, 1998.

    Google Scholar 

  67. M. Wooldridge and N. R. Jennings, “Intelligent agents: Theory and practice,” Knowl. Eng. Rev., vol. 10, no.2, pp. 115–152, 1995.

    Google Scholar 

  68. M. Wooldridge and A. Rao (eds.), Foundations of Rational Agency, Applied Logic Series, Kluwer Academic Publishers, 1999.

  69. M. J. Wooldridge, “The logical modelling of computational multi-agent systems,” Ph. D. thesis, Department of Computation, UMIST, Manchester, UK, 1992.

  70. M. J. Wooldridge, “A knowledge-theoretic semantics for concurrent MetateM,” in J. P. Mu¨ ller, M. J. Wooldridge, and N. R. Jennings (eds.), Intelligent Agents III–Proceedings of the Third International Workshop on Agent Theories, Architectures, and Languages (ATAL-96), Lecture Notes in Artificial Intelligence, Springer-Verlag: Heidelberg, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, United Kingdom

    Michael Fisher

Authors
  1. Michael Fisher
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fisher, M. Temporal Development Methods for Agent-Based. Auton Agent Multi-Agent Syst 10, 41–66 (2005). https://doi.org/10.1007/s10458-004-3140-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10458-004-3140-4

Search

Navigation