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%
36
37include "int_set_channel.mzn";
38
39% i in z <-> exists (j in x) (i in y[j])
40predicate gecode_array_set_element_union(var set of int: x,
41 array[int] of var set of int: y, var set of int: z);
42
43predicate fzn_roots(array[int] of var int: x, var set of int: s,
44 var set of int: t) =
45 assert(ub(s) subset index_set(x),
46 "roots: upper bound of 's' must be a subset of the index set of 'x'",
47 if (min(index_set(x)) < 0 \/ min(ub(t)) < 1) then
48 % All values in 's' must map to a value in 't'.
49 forall(i in ub(s)) (
50 i in s -> x[i] in t
51 ) /\
52 % All values in 't' must be mapped from a value in 's'.
53 forall(i in ub(t)) (
54 i in t -> forall(j in index_set(x)) (x[j] == i -> j in s)
55 )
56 else let {
57 array[1..max(ub(t))] of var set of 0..max(index_set(x)): y,
58 } in
59 int_set_channel(x,y)
60 /\
61 gecode_array_set_element_union(t,y,s)
62 endif
63 );