BDI Goal Recognition for Agent Program Learning

Agent applications are often viewed as unduly expensive to develop and maintain in commercial contexts. Organizations often settle for less sophisticated and more traditional software in place of agent technology because of (often misplaced) fears about the development and maintenance costs of agent technology, and the often mistaken perception that traditional software offers better returns on investment. This paper aims to redress this by developing a plan recognition framework for agent program learning, where behavior logs of legacy applications (or even manually executed processes) are mined to extract a ´draft´ version of agent code that could eventually replace these applications or processes. We develop and implement techniques for inferring agent plans, specifically inferring agent goals. We propose two ways to infer goals for plans without and with a goal library respectively. Besides, a preferred goal is considered when a goal library is provided, using the notions of consistency, maximal entailment and minimality. The complexity of the plan recognition framework is analyzed and the experimental results show that the average runtime for generating Belief-Desire-Intention (BDI) plans relying on the number of expansion nodes, choice branching factor and parallel branching factor in workflow nets (WF-nets), and that the plan recognition framework is feasible and computable.