this repo has no description
dekker.one
1%
2% Main authors:
3% Guido Tack <tack@gecode.org>
4%
5% Copyright:
6% Guido Tack, 2007
7%
8% This file is part of Gecode, the generic constraint
9% development environment:
10% http://www.gecode.org
11%
12% Permission is hereby granted, free of charge, to any person obtaining
13% a copy of this software and associated documentation files (the
14% "Software"), to deal in the Software without restriction, including
15% without limitation the rights to use, copy, modify, merge, publish,
16% distribute, sublicense, and/or sell copies of the Software, and to
17% permit persons to whom the Software is furnished to do so, subject to
18% the following conditions:
19%
20% The above copyright notice and this permission notice shall be
21% included in all copies or substantial portions of the Software.
22%
23% THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24% EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25% MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26% NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
27% LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
28% OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
29% WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
30%
31%
32predicate gecode_range(array[int] of var int: x, int: xoff,
33 var set of int: s, var set of int: t);
34
35predicate fzn_range(array[int] of var int: x, var set of int: s,
36 var set of int: t) =
37 if (min(index_set(x)) >= 0) then
38 gecode_range(x,min(index_set(x)),s,t)
39 else
40 forall(i in ub(s)) (i in s -> x[i] in t) /\
41 forall(i in ub(t)) (
42 i in t -> exists(j in ub(s)) ( j in s /\ x[j] == i )
43 )
44 endif;