Plan indexing for state-based plans

Authors:
Louise A. Dennis
Affiliations:
Department of Computer Science, University of Liverpool, UK
Venue:
DALT'11 Proceedings of the 9th international conference on Declarative Agent Languages and Technologies
Year:
2011

Citing 4
Cited 0

Term indexing

Handbook of automated reasoning
Automated Verification of Multi-Agent Programs

ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Model checking agent programs by using the program interpreter

CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
A computational semantics for communicating rational agents based on mental models

ProMAS'09 Proceedings of the 7th international conference on Programming multi-agent systems

Quantified Score

Hi-index	0.00

Visualization

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.