| 
</2
>/2
>=/2
 
::/2
::/3
 
=</2
=>/2, 3.1.2, 3.2.3
=:=/2
=\=/2
 
#</2
#<=>/2, 3.1.2
#<=/2, 3.1.2
#>/2
#>=/2
#/2
#::/2
#=</2, 3.1.2
#=>/2, 3.1.2
#=/2, 3.1.2
##/2, 3.1.2
#/\/2, 3.1.2
#\+/1, 3.1.2
#\=/2, 3.1.2
#\//2, 3.1.2
$</2
$>/2
$>=/2
$::/2
$=</2
$=/2
$\=/2
&</2
&=/2
&=</2
&>/2
&>=/2
&\=/2
 
ac_eq/3, 3.2.2
all_disjoint/1, 5.3.4
all_intersection/2, 5.3.4
all_union/2, 5.3.4
alldifferent/1, 4.1
alldifferent/2, 4.1
already_in_heads option, 8.5.3
already_in_store option, 8.5.3
and/2, 3.1.2, 3.2.3
annotation, 10.3
approximate generalised propagation, 7.3
arithmetic constraints, 8.3
atmost/3
 
boolean constraints, 8.3
branch_and_bound, 3.2.5
breal/2, 3.1.5
 
CHR, 8
CPLEX, 9.11
check_guard_bindings option, 8.4.2, 8.5.3, 8.7, 8.7.2
chr/1, 8.5.4
chr2pl/1, 8.5.4
chr_get_constraint/1, 8.5.4
chr_get_constraint/2, 8.5.4
chr_label_with/1, 8.5.4
chr_labeling/0, 8.5.4
chr_notrace/0, 8.5.4
chr_resolve/1, 8.5.4
chr_trace/0, 8.5.4
collection_to_list/2, 3.2.1, 3.2.1, 3.2.1
column generation
lp_add_columns/4, 9.4.5
lp_add_constraints/4, 9.4.5
committed choice, 8.3
common solver interface, 2, 2.4
conflict constraint, 10.3
conflict constraints, 10.4
conflict variables, 10.4
conflict_constraints/2, 10.3, 10.3, 10.4, 10.4
conflict_vars/1, 10.4
consistent, 7.3
constraint annotation, 10.3
constraint handling rules, 8
constraint solvers, 8.3
constraints
constraints declaration, 8.5.1
control
copy_term/2, 10.2.6
cumulative/4, 4.2, 4.3
cumulative/5, 4.3
cutpool constraints, 9.5
 
dbgcomp, 8.5.3, 8.7, 8.8.1
debug_compile flag, 8.5.3, 8.7, 8.8.1
declarations
default range, 3.2.9
delayed goals, 3.2.9
delayed_goals_number/2, 3.2.7
demon/1, 10.5
difference/3, 5.4
disjoint/2
disjunctive constraints, 7.2
disjunctive/2, 4.3
domain constraints, 8.3
domain splitting, 3.2.10
domain/1, 6.1
 
element/3
eplex, 9.1
eplex:eplex_get/2, 9.11.3
eplex_add_constraints/3, 9.11.2
eplex_cleanup/0, 9.3.5, 9.4.7
eplex_cplex, 9.11
eplex_get/2, 9.3.1, 9.3.2, 9.11.3
eplex_get_iis/4, 9.9
eplex_instance/1
eplex_probe/2, 9.3.4, 9.4.3, 9.11.2
eplex_read/2, 9.3.1
eplex_set/2, 9.3.1, 9.11.3, 9.11.3
eplex_solve/1, 9.2.5
eplex_solver_setup/1, 9.2.5
eplex_solver_setup/4, 9.3.1, 9.3.3, 9.3.3, 9.4.1
eplex_var_get/3, 9.3.1
eplex_write/2, 9.3.1, 9.5.2
eplex_xpress, 9.11
equation solving, 8.3
exclude/2, 3.4.1
exclude_range/3, 3.4.1
existence of solutions, 3.2.9
 
geometric constraints, 8.3
get_bounds/3, 3.2.7
get_delta/2
get_domain/2, 3.2.7
get_domain_as_list/2, 3.2.7
get_domain_size/2, 3.2.7
get_finite_integer_bounds/3, 3.2.7
get_float_bounds/3, 3.2.7
get_ic_attr/2, 3.4.2
get_integer_bounds/3, 3.2.7
get_max/2, 3.2.7
get_median/2
get_min/2, 3.2.7
get_solver_type/2, 3.2.7
get_threshold/1
 | global cuts, 9.5
guard, 8.4.1, 8.4.2, 8.5.3, 8.7.2
 
handler declaration, 8.5.1
 
ic, 3.1.1
ic:integers/1, 9.4.1
ic_cumulative:cumulative/4, 4.2
ic_cumulative:profile/4, 4.2
ic_event/1
ic_global:alldifferent/1, 4.1
ic_global:alldifferent/2, 4.1
ic_global:sorted/2, 4.1
ic_global:sorted/3, 4.1
ic_global:sumlist/2, 4.1
ic_kernel, 3.2.11, 3.4, 3.4, 3.4.1, 3.4.2
ic_stat/1
ic_stat_get/1
ic_stat_register_event/2
impose_bounds/3, 3.4.1, 3.4.1
impose_max/2, 3.4.1
impose_min/2, 3.4.1
in/2
includes/2
indomain/1, 5.5
infers, 7.1
insetdomain/4, 5.5, 5.5
integers/1
intersection/3, 5.4
intset/3, 5.2.1
intsets/4, 5.2.1
is/2, 3.1.7, 10.5
is_in_domain/2
is_in_domain/3
is_solver_type/1, 3.2.7
is_solver_var/1, 3.2.7
 
label_with declaration, 8.5.1, 8.6, 8.7.1
labeling
labeling/1
lexico_le/2, 4.1, 4.1
lib(eplex), 2.4
lib(ic), 2.4
lib(suspend), 2.4
library
lin, 3.2.10
linear programming, interface to, 9, 9.11.3
list constraints, 8.3
local search, 10.1
locate/2, 3.2.6, 3.2.10
locate/3, 3.2.6, 3.2.6, 3.2.10
locate/4, 3.2.10
log, 3.2.10
lp_add/3, 9.4.2
lp_add_columns/2, 9.4.5
lp_add_constraints/3, 9.4.2
lp_add_constraints/4, 9.4.5
lp_add_cutpool_constraints/4
lp_add_vars/2, 9.4.2
lp_cleanup/1, 9.4.7
lp_demon_setup/5, 9.4.1, 9.4.1
lp_get/2, 9.11.3, 9.11.3, 9.11.3, 9.11.3
lp_get/3, 9.4.4, 9.5.1, 9.5.2, 9.5.2, 9.5.2, 9.11.3, 9.11.3, 9.11.3
lp_read/3, 9.4.8
lp_set/2, 9.11.3, 9.11.3
lp_set/3, 9.4.6, 9.5.2, 9.11.3, 9.11.3
lp_setup/4, 9.4.1
lp_solve/2, 9.4.3
lp_var_get/4, 9.4.4
lp_var_get_bounds/4, 9.4.4
lp_var_set_bounds/4, 9.4.2
lp_write/3, 9.4.8, 9.5.2
 
mathematical programming, interface to, 9, 9.11.3
maxlist/2, 4.1, 4.1
membership_booleans/2
minlist/2, 4.1, 4.1
minmax constraints, 8.3
mixed integer programming, interface to, 9, 9.11.3
most, 7.2
 
neg/1, 3.1.2, 3.2.3
nodbgcomp, 8.5.3, 8.7, 8.8.1
normalise_cstrs/3, 9.4.8
notin/2
 
occurrences/3, 4.1, 4.1
operator declaration, 8.5.1
options
or/2, 3.1.2, 3.2.3
ordered/2, 4.1, 4.1
ordered_sum/2, 4.1, 4.1
 
Precision, 3.2.10
Propia, 7
poss_conflict_vars/2, 10.4
potential_members/2, 5.2.3
profile/4, 4.2
propagation, 3.2.9, 10.6.1
propagation rule, 8.4.1
propositional logic, 7.2, 8.3
 
quadratic programming, interface to, 9, 9.11.3
 
r_conflict/2, 10.3, 10.3, 10.3, 10.3
r_conflict_prop/2, 10.3, 10.3
reals/1, 9.2.4, 9.4.1, 9.5.1
reduced_cost_pruning/2, 9.4.4
repair, 10.1
repair/1, 10.6.2
resource allocation, 7.2
rotate/3
 
sameset/2
scheduling, 7.2
search/6
set constraints, 8.3
set_range/3, 5.2.3
set_threshold/1
set_threshold/2, 3.2.8
set_var_type/2, 3.4.1
set_vars_type/2, 3.4.1
shift/1
simpagation rule, 8.4.1
simplex solver, interface to, 9, 9.11.3
simplification rule, 8.4.1
sorted/2, 4.1
sorted/3, 4.1
squash, 3.2.10, 3.2.10
squash/3, 3.2.10
subset/2
sumlist/2, 4.1
suspend/3, 3.4.2
suspension list
symbol_domain_index/3, 6.4
symdiff/3
 
Tentative Values, 10.2
temporal constraints, 8.3
tenable, 10.2.2
tent_call/3, 10.5, 10.5
tent_get/2, 10.2.6
tent_is/2, 10.5, 10.5
tent_set/2, 10.2.6
tentative assignment, 10.2.3
term constraints, 8.3
terminological constraints, 8.3
tree constraints, 8.3
 
unification
union/3, 5.4
unique, 7.3
 
violation, 10.3
 
wake/0, 3.4.1
weight/3, 5.3.5
 
XPRESS-MP, 9.11
 |