icparc_solvers/ech/domain.pl

154 		eval_list([A|L],L1),sort(L1,L2), X::L2.
157 	eval_list([X|L1],[Y|L2]):-
159 		eval_list(L1,L2).
169  I-I::L <=> setof(X,member(X-X,L),L1), I::L1.
170  I-V::L <=> ground(I) | setof(X,member(I-X,L),L1), V::L1.
171  I-V::L <=> ground(V) | setof(X,member(X-V,L),L1), I::L1.
187  X::[A1|L1], X::[A2|L2] <=> intersection([A1|L1],[A2|L2],L) | X::L.
189  X ne Y, X::[A|L] <=> ground(Y) , remove(Y,[A|L],L1), L1\==[A|L] |  X::L1.
190  Y ne X, X::[A|L] <=> ground(Y) , remove(Y,[A|L],L1), L1\==[A|L] |  X::L1.
191  Y le X, X::[A|L] <=> ground(Y) , remove_lower(Y,[A|L],L1), L1\==[A|L] | X::L1.
192  X le Y, X::[A|L] <=> ground(Y) , remove_higher(Y,[A|L],L1),L1\==[A|L] | X::L1.
193  Y lt X, X::[A|L] <=> ground(Y) , remove_lower(Y,[A|L],L1),remove(Y,L1,L2),
195  X lt Y, X::[A|L] <=> ground(Y) , remove_higher(Y,[A|L],L1),remove(Y,L1,L2),
199  X::Min:Max, X::[A|L] <=> remove_lower(Min,[A|L],L1),remove_higher(Max,L1,L2),
299 	gen_pair([A|L1],[B|L2],[A-B|L3]):-
300 		gen_pair(L1,L2,L3).
303  X::[A|L1], X-Y::L2 <=> intersect(I::[A|L1],I-V::L2,I-V::L3),
305  Y::[A|L1], X-Y::L2 <=> intersect(V::[A|L1],I-V::L2,I-V::L3),
307  X-Y::L1, Y-X::L2 <=> intersect(I-V::L1,V-I::L2,I-V::L3) | X-Y::L3.
308  X-Y::L1, X-Y::L2 <=> intersect(I-V::L1,I-V::L2,I-V::L3) | X-Y::L3.
310      intersect(A::L1,B::L2,C::L3):- findall(C,(member(A,L1),member(B,L2)),L3).
313  Y lt X, X-Y::L <=> A=R-S,findall(A,(member(A,L),R@< S),L1) | X-Y::L1.
314  X lt Y, X-Y::L <=> A=R-S,findall(A,(member(A,L),S@< R),L1) | X-Y::L1.
315  Y le X, X-Y::L <=> A=R-S,findall(A,(member(A,L),R@=<S),L1) | X-Y::L1.
316  X le Y, X-Y::L <=> A=R-S,findall(A,(member(A,L),S@=<R),L1) | X-Y::L1.
317  Y ne X, X-Y::L <=> A=R-S,findall(A,(member(A,L),R\==S),L1) | X-Y::L1.
318  X ne Y, X-Y::L <=> A=R-S,findall(A,(member(A,L),S\==R),L1) | X-Y::L1.
320 % X-Y::L1, Y-Z::L2 ==> intersect(A-B::L1,B-C::L2,A-C::L), X-Z::L.
321 % X-Y::L1, Z-Y::L2 ==> intersect(A-B::L1,C-B::L2,A-C::L), X-Z::L.
322 % X-Y::L1, X-Z::L2 ==> intersect(I-V::L1,I-W::L2,V-W::L), Y-Z::L.
324  X-Y::L ==> A=R-S,setof(R,A^member(A,L),L1), X::L1,
337 atmost(N,List,V,K) <=> K>N,ground(V),delete_ground(X,List,L1) |
338 		(X==V -> N1 is N-1 ; N1=N),K1 is K-1, atmost(N1,L1,V,K1).
340 	delete_ground(X,List,L1):- delete(X,List,L1),ground(X),!.
352 alldistinct([A|L]) <=> delete_ground(X,[A|L],L1) | outof(X,L1),alldistinct(L1).
370 alldistinct1(R,[A|L]) <=> ground(R),delete_ground(X,[A|L],L1) |
371 			(member(X,R) -> fail ; alldistinct1([X|R],L1)).
445 remove_lower(_,[],L1):- !, L1=[].
446 remove_lower(Min,[X|L],L1):-
449 	remove_lower(Min,L,L1).
450 remove_lower(Min,[X|L],[X|L1]):-
451 	remove_lower(Min,L,L1).
453 remove_higher(_,[],L1):- !, L1=[].
454 remove_higher(Max,[X|L],L1):-
457 	remove_higher(Max,L,L1).
458 remove_higher(Max,[X|L],[X|L1]):-
459 	remove_higher(Max,L,L1).