this repo has no description
1% 2% Main authors: 3% Guido Tack <tack@gecode.org> 4% 5% Copyright: 6% Guido Tack, 2007 7% 8% Last modified: 9% $Date: 2012-04-06 16:43:44 +1000 (Fri, 06 Apr 2012) $ by $Author: tack $ 10% $Revision: 12706 $ 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 37% Sums over Boolean variables 38predicate bool_lin_eq(array[int] of int: a, array[int] of var bool: x, 39 var int: c); 40predicate bool_lin_ne(array[int] of int: a, array[int] of var bool: x, 41 var int: c); 42predicate bool_lin_le(array[int] of int: a, array[int] of var bool: x, 43 var int: c); 44predicate bool_lin_lt(array[int] of int: a, array[int] of var bool: x, 45 var int: c); 46predicate bool_lin_ge(array[int] of int: a, array[int] of var bool: x, 47 var int: c); 48predicate bool_lin_gt(array[int] of int: a, array[int] of var bool: x, 49 var int: c); 50 51predicate bool_sum_eq(array[int] of var bool: x, var int: c) = 52 bool_lin_eq([1 | i in index_set(x)],x,c); 53predicate bool_sum_ne(array[int] of var bool: x, var int: c) = 54 bool_lin_ne([1 | i in index_set(x)],x,c); 55predicate bool_sum_le(array[int] of var bool: x, var int: c) = 56 bool_lin_le([1 | i in index_set(x)],x,c); 57predicate bool_sum_lt(array[int] of var bool: x, var int: c) = 58 bool_lin_lt([1 | i in index_set(x)],x,c); 59predicate bool_sum_ge(array[int] of var bool: x, var int: c) = 60 bool_lin_ge([1 | i in index_set(x)],x,c); 61predicate bool_sum_gt(array[int] of var bool: x, var int: c) = 62 bool_lin_gt([1 | i in index_set(x)],x,c); 63 64predicate float_sinh(var float: a, var float: b) = 65 b == (exp(a)-exp(-a))/2.0; 66 67predicate float_cosh(var float: a, var float: b) = 68 b == (exp(a)+exp(-a))/2.0; 69 70predicate float_tanh(var float: a, var float: b) = 71 let { var float: e2a = exp(2.0*a) } in 72 b == (e2a-1.0)/(e2a+1.0); 73 74predicate float_ne_reif(var float: a, var float: b, var bool: c) = 75 not c <-> a==b;