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 clause(as,bs++[b]) /\
8 forall (i in index_set(as)) (as[i] -> b) /\
9 forall (i in index_set(bs)) (bs[i] \/ b);
10
11predicate array_int_maximum(var int: m, array[int] of var int: x);
12
13predicate array_float_maximum(var float: m, array[int] of var float: x) =
14 let { int: l = min(index_set(x)),
15 int: u = max(index_set(x)),
16 float: ly = lb_array(x),
17 float: uy = ub_array(x),
18 array[l..u] of var ly..uy: y } in
19 y[l] = x[l] /\
20 m = y[u] /\
21 forall (i in l+1 .. u) ( y[i] == max(x[i],y[i-1]) );
22
23predicate array_int_minimum(var int: m, array[int] of var int: x);
24
25predicate array_float_minimum(var float: m, array[int] of var float: x) =
26 let { int: l = min(index_set(x)),
27 int: u = max(index_set(x)),
28 float: ly = lb_array(x),
29 float: uy = ub_array(x),
30 array[l..u] of var ly..uy: y } in
31 y[l] = x[l] /\
32 m = y[u] /\
33 forall (i in l+1 .. u) ( y[i] == min(x[i],y[i-1]) );