Dynamic Constraint Satisfaction in Configuration


Configuration tasks exhibit dynamic aspects which require extending the basic constraint satisfaction framework. In this paper we give a new, well-founded and relatively simple definition of such dynamic constraint satisfaction problems (DCSP). On the basis of the definition, we show that the decision problem for DCSP is NP-complete. We also show that… (More)


1 Figure or Table

Cite this paper

@inproceedings{Soininen2003DynamicCS, title={Dynamic Constraint Satisfaction in Configuration}, author={Timo Soininen and Esther M. Gelle}, year={2003} }