O-Plan is aimed at being relevant to the following types of problems: These applications fit midway between the large scale manufacturing scheduling problems found in some industries (where there are often few inter-operation constraints) and the complex puzzles dealt with by very flexible logic based tools. However, the problems of this type represent an important class of industrial relevance.

The areas in which O-Plan has already been applied are as follows:

For more information on O-Plan domains, access to the domain descriptions, and live demonstrations of many of these, see the Web Demonstrations.

O-Plan Index
AIAI Page maintained by, Last updated: Thu Apr 27 11:53:21 2000