Constraint Satisfaction

From Cohen Courses
Revision as of 21:19, 3 April 2011 by Subhodee (talk | contribs) (Created page with 'In artificial intelligence, a constraint satisfaction problem(CSP) is used to a vector of variables that satisfy all of a set of constraints. Such problems are typically solved …')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

In artificial intelligence, a constraint satisfaction problem(CSP) is used to a vector of variables that satisfy all of a set of constraints. Such problems are typically solved via search.

Some common examples of CSP are 3-SAT, 8-queens, Sudoku and graph-coloring.

Retrieved from "http://curtis.ml.cmu.edu/w/courses/index.php?title=Constraint_Satisfaction&oldid=5468"