Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs
Anagh Lal, Berthe Y. Choueiry, Eugene C. Freuder · Lincoln (University of Nebraska) · 2005
A Constraint Satisfaction Problem (CSP) is a combinatorial decision problem defined by a set of variables, a set of domain values for these variables, and a set of constraints restricting the allowable combinations of values for variables, where the task is to find a solution (i.e., an assignment of a value to each variable satisfying all constraints), or to find all such solutions. Neighborhood Interchangeability and Dynamic Bundling for Non-binary CSPs S c d, e, f