Building multi-agent systems using Jason

  • Niklas Skamriis Boss
  • Andreas Schmidt Jensen
  • Jørgen VilladsenEmail author


We provide a detailed description of the Jason-DTU system, including the used methodology, tools as well as team strategy. We also discuss the experience gathered in the contest. In spring 2009 the course “Artificial Intelligence and Multi-Agent Systems” was held for the first time on the Technical University of Denmark (DTU). A part of this course was a short introduction to the multi-agent framework Jason, which is an interpreter for AgentSpeak, an agent-oriented programming language. As the final project in this course a solution to the Multi-Agent Programming Contest from 2007, the Gold Miners scenario, was implemented. Finally we decided to participate in this year’s contest with an implementation made in Jason as well.


Multi-agent systems Multi-agent programming contest Jason AgentSpeak 

Mathematics Subject Classification (2010)

68T42 68T20 68T30 68T27 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bordini, R.H., Hübner, J.F., Tralamazza, D.M.: Developing a team of gold miners using Jason. In: Proceedings of Programming Multi-Agent Systems. Lecture Notes in Computer Science, vol. 4908, pp. 241–245. Springer (2008)Google Scholar
  2. 2.
    Bordini, R.H., ooldridge, M., Hübner, J.F.: Programming Multi-Agent Systems in AgentSpeak Using Jason. Wiley (2007)Google Scholar
  3. 3.
    Padgham, L., Winikoff, M.: Developing Intelligent Agent Systems: A Practical Guide. Wiley (2007)Google Scholar
  4. 4.
    Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice Hall (2003)Google Scholar
  5. 5.
    Villadsen, J.: Paraconsistent assertions. In: Proceedings of Multiagent System Technologies. Lecture Notes in Computer Science, vol. 3187, pp. 99–113. Springer (2004)Google Scholar
  6. 6.
    Villadsen, J.: A paraconsistent higher order logic. In: Proceedings of Artificial Intelligence and Symbolic Computation. Lecture Notes in Computer Science, vol. 3249, pp. 38–51. Springer (2004)Google Scholar
  7. 7.
    Villadsen, J.: Supra-logic: using transfinite type theory with type variables for paraconsistency. J. Appl. Non-Class. Log. 15(1), 45–58 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Villadsen, J.: Nominalistic logic: from naive set theory to intensional type theory. In: New Approaches to Classes and Concepts. Studies in Logic, vol. 14, pp. 57–85. College Publications (2008)Google Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  • Niklas Skamriis Boss
    • 1
  • Andreas Schmidt Jensen
    • 1
  • Jørgen Villadsen
    • 1
    Email author
  1. 1.Department of Informatics and Mathematical ModellingTechnical University of DenmarkKongens LyngbyDenmark

Personalised recommendations