RATIONALE

"Mittal, Dynamic CSP"

S. Mittal & B. Falkenhainer, Dynamic Constraint Satisfaction
Problems. Proc. 8th Nat. Conf. on AI, AAAI-90, 1990, pp. 25-32.  



This paper presents Configuration problems in the context of
Constraint Satisfaction Problems (CSPs).  A basic CSP requires all
variables to be known and included at the start of the problem, and
uses the contraints that relate them to help determine the possible
values for those variables.  However, in Configuration, adding a
component to a growing solution to the problem changes the variables
involved, as well as the constraints that can be used.  This is why
the authors refered to it as a "Dynamic" CSP.