Jip J. Dekker
f2a1c4e389
git-subtree-dir: software/mza git-subtree-split: f970a59b177c13ca3dd8aaef8cc6681d83b7e813
18 lines
1016 B
MiniZinc
18 lines
1016 B
MiniZinc
predicate fzn_diffn_nonstrict_k_reif(array[int,int] of var int: box_posn,
|
|
array[int,int] of var int: box_size, var bool: b) =
|
|
let { set of int: DIMS= index_set_2of2(box_posn) } in
|
|
b <-> forall(b1, b2 in index_set_1of2(box_posn) where b1 < b2)
|
|
(fzn_diffn_nonstrict_nonoverlap_k_for_reif([ box_posn[b1,j] | j in DIMS ],
|
|
[ box_size[b1,j] | j in DIMS ],
|
|
[ box_posn[b2,j] | j in DIMS ],
|
|
[ box_size[b2,j] | j in DIMS ] )
|
|
)
|
|
;
|
|
|
|
predicate fzn_diffn_nonstrict_nonoverlap_k_for_reif(array[int] of var int: x1,
|
|
array[int] of var int: w1,
|
|
array[int] of var int: x2,
|
|
array[int] of var int: w2) =
|
|
exists(j in index_set(x1))
|
|
(w1[j] = 0 \/ w2[j] = 0 \/ x1[j] + w1[j] <= x2[j] \/ x2[j] + w2[j] <= x1[j]);
|