In this paper, we propose a new shared task called HOO: Helping Our Own. The aim is to use tools and techniques developed in computational linguistics to help people writing about computational linguistics. We describe a text-to-text generation scenario that poses challenging research questions, and delivers practical outcomes that are useful in the first case to our own community and potential...

A concept of sequential planning is presented as extension and generalization of “pure” sequential procedures. According to it, observations are collected in groups of variable sizes. The article discusses optimality of sequential plans in terms of a suitable risk function that balances an observation cost and a group cost. It is shown that only non-randomized sequential plans based on a suffic...

The utility of including cyclic flow of control in plans has been long recognized by the planning community. Loops in a plan increase both its applicability and the compactness of representation. However, progress in finding such plans has been limited largely due to lack of methods for reasoning about the correctness and applicability of loops of actions. We present an overview of recent resul...

The optimal survivor search problem is to maximize the probability of finding a moving target alive. The target may be a person missing at sea or lost in a wilderness area. In a multistate target problem, the target is moving and changing states stochastically. Each state may imply different motion and detectability assumptions. We find necessary and sufficient conditions for optimal detection ...

Circuit-switched networks are emerging as an attractive alternative to conventional packetswitched ones for some types of application, particularly ones involving transferring a large volume of data. The ESLEA Project will use the UKLight circuit-switched network, and its analogues overseas, to demonstrate the usefulness of circuit-switched networks in several applications disciplines. A circui...

Generating good, production-quality plans is an essential element in transforming planners from research tools into real-world applications , but one that has been frequently overlooked in research on machine learning for planning. This paper describes quality , an architecture that automatically acquires operational quality-improving control knowledge given a domain theory, a domain-speciic me...

A generic planning system is introduced which allows for custom building of planners able to generate plans for diierent plan consumers in the context of intelligent assistance systems. All planners are adapted to the peculari-ties of diierent plan consumers, to their domain knowledge, their typical behavior, their preferences, and their utilization of plans. The necessary knowledge sources of ...

Much recent planning research has focused on two related issues. First, there has been a strong interest in information-gathering (or \sensing", or \knowledge-producing") actions. Second, has been an investigation of plans with sophisticated control structures, such as conditional branches and loops. But the combination of these two lines of research poses a represen-tational problem: plans wit...

The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representation. However, progress in finding such plans has been limited largely due to lack of methods for reasoning about the correctness and safety properties of loops of actions. We present novel algorithms for determining th...

This extended abstract describes essential aspects of a current application scenario which was initiated in order to investigate the applicability of research results of the RAP project in a rather real-world environment. The work on this scenario is not completed which means that reported results are rather preliminary. The project RAP (_Reasoning About Plans) (Bauer al. 1996) aims at a logic-...