17 Feb 2005
CS 3243 - Constraint Satisfaction
7
Varieties of CSPs
nDiscrete variables
nfinite domains:
nn variables,
domain size d à O(dn) complete
assignments
ne.g., Boolean CSPs, incl.~Boolean satisfiability
(NP-complete)
ninfinite domains:
nintegers, strings, etc.
ne.g., job scheduling, variables are start/end days for
each job
nneed a constraint language, e.g., StartJob1 + 5 ≤ StartJob3
nContinuous variables
ne.g., start/end times for Hubble Space Telescope
observations
nlinear constraints solvable in polynomial time by linear
programming