MAINTAINING COMPUTATIONAL FLOW IN A DATA-DEPENDENT CONSTRAINT NETWORK

Presented are methods for determining computational flow for a data-dependent constraint network that are especially useful for modeling and trading off alternative configurations in a single computational environment, during design analysis and optimization of an engineering system. These methods leverage a preexisting constraint management system that uses a bipartite graph of variables and constraints to model an engineering system and employ logic formulae based world sets to determine the applicability of the constraints to different system configurations. These methods ensure that a data-dependent constraint network is in a consistent state, and are the essential foundation for other techniques that rely on a consistent constraint network to produce computational plans for propagating values and uncertainties through the constraint network during tradeoff analyses.