Did you know ... Search Documentation:
 Title for pldoc(dir_index)

clp

Prolog files

bounds.pl  -- Simple integer solver that keeps track of upper and lower bounds
clp_events.pl
clpb.pl  -- CLP(B): Constraint Logic Programming over Boolean Variables
labeling/1Enumerate concrete solutions.
random_labeling/2Select a single random solution.
sat/1True iff Expr is a satisfiable Boolean expression.
sat_count/2Count the number of admissible assignments.
taut/2Tautology check.
weighted_maximum/3Enumerate weighted optima over admissible assignments.
clpfd.pl  -- CLP(FD): Constraint Logic Programming over Finite Domains
#/\/2P and Q hold.
#</2The arithmetic expression X is less than Y.
#<==/2Q implies P.
#<==>/2P and Q are equivalent.
#=/2The arithmetic expression X equals Y.
#=</2The arithmetic expression X is less than or equal to Y.
#==>/2P implies Q.
#>/2Same as Y #< X.
#>=/2Same as Y #=< X.
#\/1Q does not hold.
#\/2Either P holds or Q holds, but not both.
#\//2P or Q holds.
#\=/2The arithmetic expressions X and Y evaluate to distinct integers.
all_different/1Like all_distinct/1, but with weaker propagation.
all_distinct/1True iff Vars are pairwise distinct.
automaton/3Describes a list of finite domain variables with a finite automaton.
automaton/8Describes a list of finite domain variables with a finite automaton.
chain/2Zs form a chain with respect to Relation.
circuit/1True iff the list Vs of finite domain variables induces a Hamiltonian circuit.
cumulative/1Equivalent to `cumulative(Tasks, [limit(1)])`.
cumulative/2Schedule with a limited resource.
disjoint2/1True iff Rectangles are not overlapping.
element/3The N-th element of the list of finite domain variables Vs is V.
fd_dom/2Dom is the current domain (see in/2) of Var.
fd_inf/2Inf is the infimum of the current domain of Var.
fd_size/2Reflect the current size of a domain.
fd_sup/2Sup is the supremum of the current domain of Var.
fd_var/1True iff Var is a CLP(FD) variable.
global_cardinality/2Global Cardinality constraint.
global_cardinality/3Global Cardinality constraint.
in/2Var is an element of Domain.
indomain/1Bind Var to all feasible values of its domain on backtracking.
ins/2The variables in the list Vars are elements of Domain.
label/1Equivalent to `labeling([], Vars)`.
labeling/2Assign a value to each variable in Vars.
lex_chain/1Lists are lexicographically non-decreasing.
scalar_product/4True iff the scalar product of Cs and Vs is in relation Rel to Expr.
serialized/2Describes a set of non-overlapping tasks.
sum/3The sum of elements of the list Vars is in relation Rel to Expr.
transpose/2Transpose a list of lists of the same length.
tuples_in/2True iff all Tuples are elements of Relation.
zcompare/3Analogous to compare/3, with finite domain variables A and B.
clpq.pl
clpr.pl
simplex.pl  -- Solve linear programming problems
assignment/2Solves a linear assignment problem.
constraint/3Adds a linear or integrality constraint to the linear program corresponding to state S0.
constraint/4Like constraint/3, and attaches the name Name (an atom or compound term) to the new constraint.
constraint_add/4Left is a list of `Coefficient*Variable` terms.
gen_state/1Generates an initial state corresponding to an empty linear program.
maximize/3Maximizes the objective function, stated as a list of `Coefficient*Variable` terms that represents the sum of its elements, with respect to the linear program corresponding to state S0.
minimize/3Analogous to maximize/3.
objective/2Unifies Objective with the result of the objective function at the obtained extremum.
shadow_price/3Unifies Value with the shadow price corresponding to the linear constraint whose name is Name.
transportation/4Solves a transportation problem.
variable_value/3Value is unified with the value obtained for Variable.