Multilevel Refinement Planning in an Interval-Based Temporal Logic

We present a strategy for deductive plan formation where prefabricated general solutions are adapted to special problems. The strategy is an instance of refinement planning with a particular technique for representing abstract solution patterns. It is developed within an interval-based temporal logic where plans are treated as an executable form of specification. Following the paradigm to view plans as programs basic actions as well as composite plans are built using a programming language with add and delete as elementary operations.