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_inverse_set(array[int] of var set of int: f,
33 array[int] of var set of int: invf, int: xoff, int: yoff);
34
35predicate fzn_inverse_set(array[int] of var set of int: f,
36 array[int] of var set of int: invf) =
37 forall(i in index_set(f)) (
38 f[i] subset index_set(invf)
39 ) /\
40 forall(j in index_set(invf)) (
41 invf[j] subset index_set(f)
42 ) /\
43 if (min(index_set(f)) >= 0 /\ min(index_set(invf)) >= 0) then
44 gecode_inverse_set(f,invf,min(index_set(f)),min(index_set(invf)))
45 else
46 forall(i in index_set(f), j in index_set(invf)) (
47 (j in f[i] <-> i in invf[j])
48 )
49 endif;