Advertisement

Plan Indexing for State-Based Plans

  • Louise A. Dennis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7169)

Abstract

We consider the issue of indexing plans (or rules) in the implementation of BDI languages. In particular we look at the issue of plans which are not triggered by the occurence of specific events. The selection of a plan from such a set represents one of the major bottle-necks in the execution of BDI programs. This bottle-neck is particularly obvious when attempting to use program model checkers to reason about such languages.

This paper describes the problem and examines one possible indexing scheme. It evaluates the scheme experimentally and concludes that it is only of benefit in fairly specific circumstances. It then discusses ways the indexing mechanism could be improved to provide wider benefits.

Keywords

Belief Base Horn Clause Plan Indexing Plan Selection Guard Statement 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Bordini, R.H., Dennis, L.A., Farwer, B., Fisher, M.: Automated Verification of Multi-Agent Programs. In: Proceedings of the 23rd IEEE/ACM International Conference on Automated Software Engineering (ASE), L’Aquila, Italy, pp. 69–78 (September 2008)Google Scholar
  3. 3.
    Bordini, R.H., Dennis, L.A., Farwer, B., Fisher, M.: Automated Verification of Multi-Agent Programs. In: Proc. 23rd Int. Conf. Automated Software Engineering (ASE), pp. 69–78. IEEE CS Press (2008)Google Scholar
  4. 4.
    Bordini, R.H., Hübner, J.F., Vieira, R.: Jason and the Golden Fleece of Agent-Oriented Programming. In: Bordini, R.H., Dastani, M., Dix, J., El Fallah Seghrouchni, A. (eds.) Multi-Agent Programming: Languages, Platforms and Applications, ch. 1, pp. 3–37. Springer, Heidelberg (2005)Google Scholar
  5. 5.
    de Boer, F.S., Hindriks, K.V., van der Hoek, W., Meyer, J.-J.C.: A Verification Framework for Agent Programming with Declarative Goals. J. Applied Logic 5(2), 277–302 (2007)zbMATHCrossRefGoogle Scholar
  6. 6.
    Dennis, L.A., Farwer, B.: Gwendolen: A BDI Language for Verifiable Agents. In: Löwe, B. (ed.) AISB 2008 Workshop, Logic and the Simulation of Interaction and Reasoning, Aberdeen, AISB (2008)Google Scholar
  7. 7.
    Forgy, C.L.: Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19, 17–37 (1982)CrossRefGoogle Scholar
  8. 8.
    Hindriks, K.V., van Riemsdijk, M.B.: A Computational Semantics for Communicating Rational Agents Based on Mental Models. In: Braubach, L., Briot, J.-P., Thangarajah, J. (eds.) ProMAS 2009. LNCS, vol. 5919, pp. 31–48. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  9. 9.
    Jongmans, S.-S.T.Q., Hindriks, K.V., van Riemsdijk, M.B.: Model Checking Agent Programs by Using the Program Interpreter. In: Dix, J., Leite, J., Governatori, G., Jamroga, W. (eds.) CLIMA XI 2010. LNCS, vol. 6245, pp. 219–237. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Rao, A.S., Georgeff, M.P.: BDI agents: From theory to practice. In: Proceedings of the First International Conference on Multi-Agent Systems (ICMAS), San Francisco, USA, pp. 312–319 (June 1995)Google Scholar
  11. 11.
    Sekar, R., Ramakrishnan, I.V., Voronkov, A.: Term Indexing. In: Handbook of Automated Reasoning, vol. 2, pp. 1853–1964. North Holland (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Louise A. Dennis
    • 1
  1. 1.Department of Computer ScienceUniversity of LiverpoolUK

Personalised recommendations