DM841 - Heuristics and Constraint Programming for Discrete Optimization
[pdf format]



Exercise 1

Recall the definition of domain consistency and relaxed domain consistency such as bound(Z), bound(D) and range consistency. What is the consistency level of the following CSPs?

  P = ⟨ x1 ∈ {1,3}, x2 ∈ {1,3}, x3 ∈ {1,3}, x4 ∈ {1,3},  C≡ alldifferent(x1,x2,x3,x4)⟩
  P = ⟨ x1 ∈ {1,2,3}, x2 ∈ {2,3}, x3 ∈ {2,3}, x4 ∈ {1,2,3,4},  Calldifferent(x1,x2,x3,x4)⟩
 P = ⟨ x1 ∈ {1,3}, x2 ∈ {2}, x3 ∈ {1,2,3},  C≡ alldifferent(x1,x2,x3)⟩
 P = ⟨ x1 ∈ {1,3}, x2 ∈ {2}, x3 ∈ {1,3},  C≡ alldifferent(x1,x2,x3) ⟩
  P = ⟨ x1 ∈ {1,3}, x2 ∈ {1,3}, x3 ∈ {1,3},  C≡ alldifferent(x1,x2,x3)⟩