Nonmonotonic planning features

Section III introduces the concept of nonmonotonic planning and outlines its basic features. It is shown that the tractability of nonmonotonic planning is directly related to the form of the operators employed simple propositional operators lead to polynomial-time algorithms, whereas conditional and functional operators lead to NP-hard formulations. In addition, three specific subsections establish the theoretical foundation for the conversion of operational constraints on the plans into temporal orderings of primitive operations. The three classes of constraints considered are (1) temporal ordering of abstract operations, (2) avoidable mixtures of chemical species, and (3) quantitative bounding constraints on the state of processing systems. [Pg.45]

In summary, nonmonotonic planning of process operations has the following distinguishing features ... [Pg.56]

Big Chemical Encyclopedia