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% Last modified:
9% $Date: 2012-03-19 11:56:37 +1100 (Mon, 19 Mar 2012) $ by $Author: tack $
10% $Revision: 12583 $
11%
12% This file is part of Gecode, the generic constraint
13% development environment:
14% http://www.gecode.org
15%
16% Permission is hereby granted, free of charge, to any person obtaining
17% a copy of this software and associated documentation files (the
18% "Software"), to deal in the Software without restriction, including
19% without limitation the rights to use, copy, modify, merge, publish,
20% distribute, sublicense, and/or sell copies of the Software, and to
21% permit persons to whom the Software is furnished to do so, subject to
22% the following conditions:
23%
24% The above copyright notice and this permission notice shall be
25% included in all copies or substantial portions of the Software.
26%
27% THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
28% EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
29% MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
30% NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
31% LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
32% OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
33% WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
34%
35%
36predicate gecode_range(array[int] of var int: x, int: xoff,
37 var set of int: s, var set of int: t);
38
39predicate fzn_range(array[int] of var int: x, var set of int: s,
40 var set of int: t) =
41 assert(ub(s) subset index_set(x),
42 "range: upper bound of 's' must be a subset of the index set of 'x'",
43 if (min(index_set(x)) >= 0) then
44 gecode_range(x,min(index_set(x)),s,t)
45 else
46 forall(i in ub(s)) (i in s -> x[i] in t) /\
47 forall(i in ub(t)) (
48 i in t -> exists(j in ub(s)) ( j in s /\ x[j] == i )
49 )
50 endif
51 );