Learn More
Generally, constraint satisfaction problems (CSP) are NP-complete. Many subclasses, however, can be solved eeciently. They are mainly deened by properties of the variable domains, the constraint semantics, the constraint graph structures or a combination of those. In this paper, we consider a new aspect of making a CSP feasible, namely the dynamic essence(More)
  • 1