-
->/2, 3.7.2
- ::/2
- ;/2, 3.7.1
- =/2, 3.1.1
- =/2, 3.1.1
- #/2
- #::/2
- #</2
- #=/2
- #=</2
- #>/2
- #>=/2
- #\=/2
- $::/2
- $</2
- $=/2
- $=</2
- $>/2
- $>=/2
- $\=/2
- AC-3, 14.2
- AC-5, 14.2
- ac, 15.3.1
- ac_eq/3, 8.4, 8.4
- accept/3, 4.5.4, 4.5.4
- aliasing, 3.3.3
- all_disjoint/1, 10.4
- all_intersection/2, 10.4
- all_union/2, 10.4
- alldifferent/1
- alternative search methods, 12.1
- arc consistency, 14.2, 14.3.3, 15.3.3
- arity, 3.1.5
- assignment, 12.1
- atom, 3.1.3
- backtrack count, 12.2.5
- backtracking, 3.5.1
- bagof/3, 3.7.4
- bb_min/3, 12.3.5
- bb_min/6, 12.3.5
- before, 17.3.2
- behaviour of a constraint, 14.3
- benders decomposition, 17.6
- bigM transformation, 17.4.2
- bin packing, 10.7
- bind/2, 4.5.4
- binding, 3.3.3
- bounded backtrack search, 12.3.2
- bounded reals, 3.1.1, 9.1, 9.2
- bounds consistency, 14.3.4, 14.6
- branch-and-bound, 12.1.2
- branch_and_bound, 7.4.2
- breal/2, 9.1
- C++, 11.2
- CHIP, 11.2
- CHR, 15.4
- Constraint Logic Programming, 11.1
- CSP, 14.2
- call, 3.7.3
- cardinality constraint, 10.4
- ccompile
- ccompile/1, 6.3.1
- ccompile/1, 6.3.1
- ccompile/2, 6.3.1
- ccompile/2, 6.3.1
- choice, 12.2.1
- chr, 7.3.2
- clause, 3.4.2, 3.4.2
- clique, 15.5
- close/1, 4.5.4
- column generation, 17.6
- combinatorial problems, 11.1
- comment, 3.4.1
- commit, 3.8.1
- compilation
-
nesting compile commands, 2.6
- compile, 2.5.1
- compile/1, 2.8.1
- complete search, 12.1.1, 12.2
- conditional, 3.7.2
- conditional spying, 5.3
- conflict minimisation, 13.3
- conflict sets, 13.2.2
- conflict_constraints/2, 13.2.3
- conjunction, 3.2.1, 3.2.1
- consistency check, 14.3.1, 14.4.1
- consistent, 15.3.1
- constraint, 14.1
- constraint satisfaction problem, 14.2
- constraints/1, 15.1
- constructive disjunction, 15.3.3
- constructive search, 12.1.1
- coverage, 6.3
- coverage, 6.3.1, 6.3.2
- coverage counters, 6.3
- cputime/1, 4.12.1
- credit search, 12.3.4
- crossword, 15.3.1
- cumulative, 7.2.4
- cut, 3.8
- delayed goals viewer, development tool, 5.4.3
- delete/5, 12.2.4
- demon, 14.7, 14.7
- demon/1, 14.7
- depth-bounded search, 12.3.3
- depth-first search, 12.2
- difference/3, 10.4
- dim/2, 4.3, 4.3, 4.3
- discrepancy, 12.3.6
- disjoint/2
- disjointness constraint, 10.4
- disjunction, 3.2.1, 3.2.1, 3.7.1
- disjunctive, 17.4.2
- do/2, 4.2
- domain consistency, 14.3.3
- domain splitting, 12.2.1
- dual values, 17.5.3
- ech, 7.3.2
- edge_finder, 7.2.4
- empty list, 3.1.4
- entailment, 15.5.1
- eplex, 7.2.6
- eplex_get/2, 16.4
- eplex_instance/1, 16.3.2
- eplex_solve/1, 16.3.2
- eplex_solver_setup/1, 16.3.2
- eplex_solver_setup/4, 16.4
- eplex_var_get/3, 16.3.3
- equality
- error, 4.5.4
- exec/2, 4.5.4
- exec/3, 4.5.4
- exec_group/3, 4.5.4
- findall/3, 3.7.4
- finite sets, 10.1
- first solution, 12.3.1
- first-fail principle, 12.2.4
- floating point numbers, 3.1.1
- flush/1, 4.5.4
- forward checking, 14.3.2, 14.4.2
- functor, 3.1.5
- garbage_collect/0, 4.12.1
- generalised propagation, 15.3
- generating test networks, 17.4.4
- get_flag/2, 2.5.7
- global constraints
- global reasoning, 15.6
- goal, 3.2
- greedy heuristic, 10.7
- help, 2.5.6
- heuristics, 12.1.3
- hybrid optimization, 17.3.3
- ic, 7.2.2
- ic_global, 7.2.3
- ic_search, 7.4.1, 12.2.4
- ic_sets, 7.2.5
- ic_symbolic, 7.2.7
- implementing constraints, 14
- in/2
- includes/2
- inclusion constraint, 10.4
- incomplete search, 12.1.1, 12.3
- incompleteness of propagation, 14.3.4
- indomain/1, 8.7
- indomain/1, 9.5, 10.5
- infers/2, 15.3.1
- infix, 3.1.5
| - input, 4.5.4
- insetdomain/4, 10.5
- inspecting terms, 5.3
- instantiation, 3.3.3
- integer numbers, 3.1.1
- integer/1, 3.2
- integers/1
- intersection/3, 10.4
- interval arithmetic, 9.1
- intset/3, 10.3
- intsets/4, 10.3
- is/2, 3.1.1
- is/2, 3.1.1
- Kowalski, 11.1
- knapsack, 10.7, 13.5.1
- Linear Programming (LP), 16.1.1
- labeling, 12.2.1
- labeling/1, 8.7
- lagrangian relaxation, 17.6
- lexico_le/1
- lib/1, 2.7
- libraries, 2.7
- library
-
coverage, 6.3
- ic, 9.3, 9.6
- ic_cumulative, 8.5
- ic_edge_finder, 8.5
- ic_edge_finder3, 8.5
- ic_global, 8.5, 8.5.1
- ic_sets, 10, 10.8
- limited discrepancy search, 12.3.6
- line coverage, 6.3
- linear relaxation, 17.4.2
- list, 3.1.4
- listen/2, 4.5.4
- local search, 13.5
- locate/2, 9.3, 9.4, 9.4, 9.5
- locate/3, 9.3, 9.4
- locate/4, 9.3
- log_output, 4.5.4
- logical variable, 3.3.2
- logical variables, 3.3.2
- Mathematical Programming (MP), 16.1.1
- Mixed Integer Programming (MIP), 16.1.1
- MSG, 15.3.2
- mathematical modelling languages, 11.2
- membership constraint, 10.4
- metacall, 3.7.3
- middle-first, 12.2.4
- modelling, 11.1, 15.2
- modelling, LP problem, 16.3.2
- modelling, MIP, 16.3.4
- most, 15.3.1
- most specific generalisation, 15.3.2
- move-based search, 12.1.1
- multiple solvers, 17.4
- nil, 3.1.4
- noclash, 15.1
- node consistency, 14.2
- notin/2
- null, 4.5.4
- number, 3.1.1
- objective function, 16.1.1
- once/1, 12.3.1
- open/3, 4.5.4, 4.5.4, 4.5.4, 4.5.4
- operator syntax, 3.1.5
- optimisation, 6, 12.1.2
- optimisation (numerical), 16.1.1
- output, 4.5.4
- overlap, 17.3.2
- partition a search space, 12.2.1
- path consistency, 14.2
- performance, 6
- piecewise linear, 17.6
- postfix, 3.1.5
- predicate, 3.2, 3.4.2
- predicate browser, development tool, 5.3, 5.4.2
- prefix, 3.1.5
- pretty_printer, 6.3.2
- printf/2, 4.5.3
- priority, 14.5
- probing, 13.3.1, 17.5.2
- probing_for_scheduling, 17.5.3
- probing_for_scheduling, 7.5.2
- problem-specific heuristic, 12.2.4
- product, 15.2
- product_plan, 15.2
- profile/1, 6.2
- profiling, 6.2
- program analysis, 6, 6.3.2
- propagation rule, 15.4.1
- propia, 7.3.1, 15.3
- prune, 3.8.2
- pruning, 12.1.3
- queens, 12.2.4
- query, 2.5.2, 2.6, 3.2
- r_conflict/2, 13.2.3
- random search, 12.1.1
- random walk, 13.5.3
- rational numbers, 3.1.1
- read/1, 4.5.4
- read/1, 4.5.4
- read/2, 4.5.4
- reals/1
- reduced costs, 17.5.1
- reduced_cost_pruning, 17.5.1
- repair, 7.5.1, 13.2
- reset_counters
- reset_counters/0, 6.3.2
- resolution, 3.5.1, 3.5.1
- resolvent, 3.5.1
- result
- result/0, 6.3.2
- result/0, 6.3.2
- result/1, 6.3.2
- result/1, 6.3.2
- result/2, 6.3.2
- result/2, 6.3.2
- Steiner problem, 10.6
- sameset/2
- search space, 12.1
- search tree, 12.1.1
- search/6, 12.3
- select/3, 4.5.4
- set variable, 10.3
- set_flag/2, 2.5.7, 4.12.1
- setof/3, 3.7.4
- shallow backtrack, 12.2.5
- simpagation rule, 15.4.2
- simplification rule, 15.4.1
- simulated annealing, 13.5.4
- socket/3, 4.5.4, 4.5.4
- specification languages, 11.2
- squash/3, 9.3, 9.4, 9.4
- statistics/0, 2.5.7, 4.12.1
- statistics/2, 2.5.7, 4.12.1, 4.12.1
- string, 3.1.2
- structure, 3.1.5
- subset constraint, 10.4
- subset/2
- suspend, 7.2.1
- suspend/3, 14.5, 14.5
- suspension, 14.5
- symdiff/3
- tabu Search, 13.5.5
- tail, 3.6
- tent_get/2, 13.2.3
- tent_is/2, 13.2.3
- tent_set/2, 13.2.3
- term, 3.1
- term inspector, development tool, 5.3, 5.4.6
- timeout, 12.3.5
- toplevel, 5.4.1
- tracer filter, development tool, 5.3, 5.4.5
- tracer, development tool, 5.3, 5.4.4
- tracing program execution, 5.3
- tree search, 12.1.1
- trigger condition, 14.3, 14.5
- types, 3.1
- unification, 3.3.3, 3.3.3
- union/3, 10.4
- unique, 15.3.1
- update_struct/4, 4.1
- use_module/1, 2.7
- value selection, 12.2.3
- variable selection, 12.2.2
- variables, 3.3.2
- warning_output, 4.5.4
- weight constraint, 10.7
- weight/3, 10.7
- windows, 6.2
- write/1, 4.5.4
- write/1, 4.5.4
- write/2, 4.5.4
- write_term/2, 4.5.3
|
