Difference between revisions of "Constraint Satisfaction"
From Cohen Courses
Jump to navigationJump to search (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 …') |
(No difference)
|
Latest revision as of 22:19, 3 April 2011
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.
