17 Feb 2005
CS 3243 - Constraint Satisfaction
3
Constraint satisfaction problems (CSPs)
nStandard search problem:
nstate is a “black box” – any data structure that supports successor function, heuristic function, and goal test
nCSP:
nstate is defined by variables Xi with values from domain Di
ngoal test is a set of constraints specifying allowable combinations of values for subsets of variables
n
nSimple example of a formal representation language
n
nAllows useful general-purpose algorithms with more power than standard search algorithms