this repo has no description
dekker.one
1% This file contains redefinitions of standard builtins that can be overridden
2% by solvers.
3
4predicate bool_clause_reif(array[int] of var bool: as,
5 array[int] of var bool: bs,
6 var bool: b);
7
8predicate array_int_maximum(var int: m, array[int] of var int: x);
9
10predicate array_float_maximum(var float: m, array[int] of var float: x) =
11 let { int: l = min(index_set(x)),
12 int: u = max(index_set(x)),
13 float: ly = lb_array(x),
14 float: uy = ub_array(x),
15 array[l..u] of var ly..uy: y } in
16 y[l] = x[l] /\
17 m = y[u] /\
18 forall (i in l+1 .. u) ( y[i] == max(x[i],y[i-1]) );
19
20predicate array_int_minimum(var int: m, array[int] of var int: x);
21
22predicate array_float_minimum(var float: m, array[int] of var float: x) =
23 let { int: l = min(index_set(x)),
24 int: u = max(index_set(x)),
25 float: ly = lb_array(x),
26 float: uy = ub_array(x),
27 array[l..u] of var ly..uy: y } in
28 y[l] = x[l] /\
29 m = y[u] /\
30 forall (i in l+1 .. u) ( y[i] == min(x[i],y[i-1]) );