CPSolver.Propagator.Reified (Fixpoint v0.8.40)
The propagator for reification constraints.
Full reification:
- If b is fixed to 1, the propagator for the reification reduces to a propagator for C.
- If b is fixed to 0, the propagator for the reification reduces to a propagator for opposite(C).
- If a propagator for C would realize that the C would be entailed, the propagator for the reification fixes b to 1 and ceases to exist.
- If a propagator for C would realize that the C would fail, the propagator for the reification fixes x b to 0 and ceases to exist.
Half-reification:
Rules 2 and 3 of full reification.
Inverse implication:
Rules 1 and 4 of full reification.
Summary
Functions
Callback implementation for CPSolver.Propagator.arguments/1
.
Callback implementation for CPSolver.Propagator.entailed?/2
.
Callback implementation for CPSolver.Propagator.failed?/2
.
Callback implementation for CPSolver.Propagator.reset/2
.
Callback implementation for CPSolver.Propagator.reset/3
.
Functions
Link to this function
arguments(args)
Callback implementation for CPSolver.Propagator.arguments/1
.
Link to this function
entailed?(args, propagator_state)
Callback implementation for CPSolver.Propagator.entailed?/2
.
Link to this function
failed?(args, propagator_state)
Callback implementation for CPSolver.Propagator.failed?/2
.
Link to this function
new(args)
Link to this function
new(propagators, b_var, mode)
Link to this function
reset(args, state)
Callback implementation for CPSolver.Propagator.reset/2
.
Link to this function
reset(args, state, opts)
Callback implementation for CPSolver.Propagator.reset/3
.