clpBNR.pl -- clpBNR: Constraint Logic Programming over Continuous Domain of Reals |
|---|
| clpBNR_toolkit.pl -- clpBNR_toolkit: Toolkit of various utilities used for solving problems with clpBNR |
|---|
| cf_contractor/2 | Succeeds if each interval in As can be unified with the midpoints of the respective interval in Xs; otherwise fails. | |
| cf_solve/1 | | |
| cf_solve/2 | Succeeds if a solution can be found for all variables in the centre form contractor, Contractor, where the resultant domain of any variable is narrower than the limit specified by Precision (for cf_solve/1, default Precision is number of digits as defined by the environment flag clpBNR_default_precision); otherwise fails. | |
| lin_maximize/3 | Succeeds if the global maximum value of the objective function ObjF subject to Constraints can be unified with Max; otherwise fails. | |
| lin_maximum/3 | Succeeds if the global minimum value of the objective function ObjF subject to Constraints can be unified with Max; otherwise fails. | |
| lin_minimize/3 | Succeeds if the global minimum value of the objective function ObjF subject to Constraints can be unified with Min; otherwise fails. | |
| lin_minimum/3 | Succeeds if the global minimum value of the objective function ObjF subject to Constraints can be unified with Min; otherwise fails. | |
| local_maxima/1 | Succeeds if the value of objective function ObjF can be constrained to be a local maximum, i.e, it's "slope" is 0 in every dimension; otherwise fails. | |
| local_maxima/2 | Succeeds if the value of objective function ObjF can be constrained to be a local maximum, i.e, it's "slope" is 0 in every dimension; otherwise fails. | |
| local_minima/1 | Succeeds if the value of objective function ObjF can be constrained to be a local minimum, i.e, it's "slope" is 0 in every dimension; otherwise fails. | |
| local_minima/2 | Succeeds if the value of objective function ObjF can be constrained to be a local minimum, i.e, it's "slope" is 0 in every dimension, subject to Constraints; otherwise fails. | |
| mid_split/1 | Succeeds if X is an interval that can be split at its midpoint narrowing X to it's lower "half"; on backtracking X is constrained to the upper half; fails if X is not a numeric. | |
| mid_split_one/1 | Succeeds splitting the widest interval in Xs, a list of intervals; fails if Xs is not a list of intervals. | |
| taylor_contractor/2 | Succeeds if a centre form contractor Contractor can be generated from one or more multivariate equality (== or =:=) constraints Constraints; otherwise fails. | |
| taylor_merged_contractor/2 | Succeeds if a merged centre form contractor Contractor can be generated from each equality (== or =:=) constraint in Constraints; otherwise fails. | |