Jip J. Dekker
f2a1c4e389
git-subtree-dir: software/mza git-subtree-split: f970a59b177c13ca3dd8aaef8cc6681d83b7e813
30 lines
1.0 KiB
MiniZinc
30 lines
1.0 KiB
MiniZinc
% This file contains redefinitions of standard builtins that can be overridden
|
|
% by solvers.
|
|
|
|
predicate bool_clause_reif(array[int] of var bool: as,
|
|
array[int] of var bool: bs,
|
|
var bool: b) =
|
|
clause(as,bs++[b]) /\
|
|
forall (i in index_set(as)) (as[i] -> b) /\
|
|
forall (i in index_set(bs)) (bs[i] \/ b);
|
|
|
|
predicate array_float_maximum(var float: m, array[int] of var float: x) =
|
|
let { int: l = min(index_set(x)),
|
|
int: u = max(index_set(x)),
|
|
float: ly = lb_array(x),
|
|
float: uy = ub_array(x),
|
|
array[l..u] of var ly..uy: y } in
|
|
y[l] = x[l] /\
|
|
m = y[u] /\
|
|
forall (i in l+1 .. u) ( y[i] == max(x[i],y[i-1]) );
|
|
|
|
predicate array_float_minimum(var float: m, array[int] of var float: x) =
|
|
let { int: l = min(index_set(x)),
|
|
int: u = max(index_set(x)),
|
|
float: ly = lb_array(x),
|
|
float: uy = ub_array(x),
|
|
array[l..u] of var ly..uy: y } in
|
|
y[l] = x[l] /\
|
|
m = y[u] /\
|
|
forall (i in l+1 .. u) ( y[i] == min(x[i],y[i-1]) );
|