Difference between revisions of "CS188.1x"
From Wiki2
| Line 3: | Line 3: | ||
;binary constraint: is a constraint over a pair of variables (e.g., X≠Y). | ;binary constraint: is a constraint over a pair of variables (e.g., X≠Y). | ||
;k-ary constraint has a scope of size k. | ;k-ary constraint has a scope of size k. | ||
;variables: | |||
;domains: the set of values a variable can take | |||
====arc constraints==== | ====arc constraints==== | ||
:x-->y | :x-->y | ||
For every x-value in the tail is there a is there some y-value that can meet the constraints. If not then remove those values from x. | For every x-value in the tail is there a is there some y-value that can meet the constraints. If not then remove those values from x. | ||
Revision as of 09:43, 14 October 2012
constraints
- unary constraint
- is a constraint on a single variable (e.g., X≠4).
- binary constraint
- is a constraint over a pair of variables (e.g., X≠Y).
- k-ary constraint has a scope of size k.
- variables
- domains
- the set of values a variable can take
arc constraints
- x-->y
For every x-value in the tail is there a is there some y-value that can meet the constraints. If not then remove those values from x.
