Plan Indexing for State-Based Plans

Research output: Chapter in Book/Report/Conference proceedingOther chapter contributionpeer-review

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.
Original languageUndefined
Title of host publicationDeclarative Agent Languages and Technologies IX
EditorsChiaki Sakama, Sebastian Sardina, Wamberto Vasconcelos, Michael Winikoff
Pages3-15
Number of pages13
DOIs
Publication statusPublished - 2012

Publication series

Name Lecture Notes in Computer Science
Volume7169

Cite this