Intrusion Detection Systems (IDSs) are security tools widely used in computer networks. While they seem to be promising technologies, they pose some serious drawbacks: When utilized in large and high traffic networks, IDSs generate high volumes of low-level alerts which are hardly manageable. Accordingly, there emerged a recent track of security research, focused on alert correlation, which ext...

This paper presents a discussion of the theoretical complexity of plan recognition on the basis of an analysis of the number of explanations that any complete plan recognition algorithm must consider given various properties of the plan library. On the basis of these results it points out properties of plan libraries that make them computationally expensive. Introduction Plan recognition is a w...

As the application field of plan recognition expands continuously, the traditional plan recognition methods have hindered the application of plan recognition in hostile environment, which ignored the defects of misleading action. In this paper, a plan recognition algorithm based on the process of misleading action is proposed under the framework of plan knowledge graph. The method makes it poss...

Recent applications of plan recognition require observing agents whose behavior is reactive, in that the observed agent may be so intelligent as to coordinate their plans. With the analysis of these domain characteristics in military plan recognition, we propose that the multi-agent tactical plan recognition is essentially a problem about abduction, and detail the knowledge organization and log...

While most plan recognition systems make use of a plan library that contains the set of available plan hypotheses, little effort has been devoted to the question of how to create such a library. This problem is particularly difficult to deal with when only little domain knowledge is available—a common situation when e.g. developing a help system for an already existing software system. This pap...

Terminological Plan Recognition Diane Litman, AT&T Bell Laboratories, USA Description logics are widely used in AI to construct concept taxonomies based on subsumption inferences. However, current description logics are unable to handle complex compositions of concepts, for example constraint networks where each node is described by an associated concept. Plans can be thought of as constraint n...

My Ph.D. dissertation (Calistri 1990) extends traditional methods of plan recognition to handle situations in which agents have flawed plans.1 This extension involves solving two problems: determining what sorts of mistakes people make when they reason about plans and figuring out how to recognize these mistakes when they occur. I have developed a complete classification of plan-based misconcep...

While plan recognition research has been applied to a wide variety of problems, it has largely made identical assumptions about the number of agents participating in the plan, the observability of the plan execution process, and the scale of the domain. We describe a method for plan recognition in a real-world domain involving large numbers of agents performing spatial maneuvers in concert unde...

A key issue in interactive storytelling is how to generate stories which are, at the same time, interesting and coherent. On the one hand, it is desirable to provide means for the user to intervene in the story. But, on the other hand, it is necessary to guarantee that user intervention will not introduce events that violate the rules of the intended genre. This paper describes the usage of a p...