Previous work on the generation of natural language descriptions of complex activities has indicated that the unwieldy amount of text needed to describe complete plans makes for ine ective and unnatural descriptions. We argue here that concise and e ective text descriptions of plans can be generated by exploiting a model of the hearer's plan reasoning capabilities. We de ne a computational mode...

The ability of a planner to modify a plan is considered as a valuable tool for improving ee-ciency of planning by avoiding the repetition of the same planning eeort. From a computational complexity point of view, however, it is by no means obvious that modifying a plan is com-putationally as easy as planning from scratch if the modiication has to follow the principle of \conservatism," i.e., to...

Taxpayer support for public colleges has been falling sharply in recent years, not only in New York but around the country, and this has lately been causing a great deal of concern among many administra t o r s. The trend has also led to j o l t i n g , unpredictable tuition i n c r e a s e s. But CUNY has developed a long-term plan that could become a national model for the funding of public c...

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...

The ability of a planner to modify a plan is considered as a valuable tool for improving ee-ciency of planning by avoiding the repetition of the same planning eeort. From a computational complexity point of view, however, it is by no means obvious that modifying a plan is computationally as easy as planning from scratch if the modiication has to follow the principle of \conservatism," i.e., to ...

This paper addresses the indexing and retrieval issues in the context of the case-based plan recognition. The indexing and storage mechanisms utilize the knowledge about planning situations that enable the recognizer to focus its search to a subset of the plan library containing relevant past plans. A two-level abstract indexing scheme, along with the incremental construction of the plan librar...

We present the PHATT algorithm for plan recognition. Unlike previous approaches to plan recognition, PHATT is based on a model of plan execution. We show that this clarifies several difficult issues in plan recognition including the execution of multiple interleaved root goals, partially ordered plans, and failing to observe actions. We present the PHATT algorithm’s theoretical basis, and an im...