this repo has no description
at develop 2.1 kB view raw
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_inverse_set(array[int] of var set of int: f, 37 array[int] of var set of int: invf, int: xoff, int: yoff); 38 39predicate fzn_inverse_set(array[int] of var set of int: f, 40 array[int] of var set of int: invf) = 41 forall(i in index_set(f)) ( 42 f[i] subset index_set(invf) 43 ) /\ 44 forall(j in index_set(invf)) ( 45 invf[j] subset index_set(f) 46 ) /\ 47 if (min(index_set(f)) >= 0 /\ min(index_set(invf)) >= 0) then 48 gecode_inverse_set(f,invf,min(index_set(f)),min(index_set(invf))) 49 else 50 forall(i in index_set(f), j in index_set(invf)) ( 51 (j in f[i] <-> i in invf[j]) 52 ) 53 endif;