Constraint Logic Programming Using ECLiPSe

Solutions to selected exercises 319
).
no_overlap(B, X1, Y1, S1, X2, Y2, S2) :-
B #=<
(X1+S1 #=< X2 or X2+S2 #=< X1 or Y1+S1 #=< Y2 or Y2+S2 #=< Y1).
capacity(Bs, Cs, Sizes, Size,Waste) :-
( for(Pos,1,Size),
foreach(W,Ws),
param(Bs,Cs,Size,Sizes)
do
( foreach(C,Cs),
foreach(B,Bs),
foreach(S,Sizes),
param(Pos),
fromto(Sum,S*Bool*B+Sum1,Sum1,0)
do
::(C, Pos-S+1..Pos, Bool)
),
W #= eval(Size)-Sum,
W #>= 0
),
Waste #= sum(Ws).
Here ::/3 is the reified form of the variable declaration built-in ::/2 (see Subsection
9.4.4). We have then for example:
[eclipse 3]: squares(1, Bs, Xs, Ys, Min).
Found a solution with cost 100
[...]
Found a solution with cost 45
Bs = [0, 0, 1, 1, 1, 1, 1]
Xs = [1, 1, 1, 1, 6, 9, 1]
Ys = [1, 1, 1, 6, 1, 1, 10]
Min = 45
Yes (6.58s cpu)