clpb.pl -- CLP(B): Constraint Logic Programming over Boolean Variables |
labeling/1 | Enumerate concrete solutions. | |
random_labeling/2 | Select a single random solution. | |
sat/1 | True iff Expr is a satisfiable Boolean expression. | |
sat_count/2 | Count the number of admissible assignments. | |
taut/2 | Tautology check. | |
weighted_maximum/3 | Enumerate weighted optima over admissible assignments. | |
clpfd.pl -- CLP(FD): Constraint Logic Programming over Finite Domains |
#/\/2 | P and Q hold. | |
#</2 | The arithmetic expression X is less than Y. | |
#<==/2 | Q implies P. | |
#<==>/2 | P and Q are equivalent. | |
#=/2 | The arithmetic expression X equals Y. | |
#=</2 | The arithmetic expression X is less than or equal to Y. | |
#==>/2 | P implies Q. | |
#>/2 | Same as Y #< X. | |
#>=/2 | Same as Y #=< X. | |
#\/1 | Q does not hold. | |
#\/2 | Either P holds or Q holds, but not both. | |
#\//2 | P or Q holds. | |
#\=/2 | The arithmetic expressions X and Y evaluate to distinct integers. | |
all_different/1 | Like all_distinct/1, but with weaker propagation. | |
all_distinct/1 | True iff Vars are pairwise distinct. | |
automaton/3 | Describes a list of finite domain variables with a finite automaton. | |
automaton/8 | Describes a list of finite domain variables with a finite automaton. | |
chain/2 | Zs form a chain with respect to Relation. | |
circuit/1 | True iff the list Vs of finite domain variables induces a Hamiltonian circuit. | |
cumulative/1 | Equivalent to cumulative(Tasks, [limit(1)]) . | |
cumulative/2 | Schedule with a limited resource. | |
disjoint2/1 | True iff Rectangles are not overlapping. | |
element/3 | The N-th element of the list of finite domain variables Vs is V. | |
fd_dom/2 | Dom is the current domain (see in/2) of Var. | |
fd_inf/2 | Inf is the infimum of the current domain of Var. | |
fd_size/2 | Reflect the current size of a domain. | |
fd_sup/2 | Sup is the supremum of the current domain of Var. | |
fd_var/1 | True iff Var is a CLP(FD) variable. | |
global_cardinality/2 | Global Cardinality constraint. | |
global_cardinality/3 | Global Cardinality constraint. | |
in/2 | Var is an element of Domain. | |
indomain/1 | Bind Var to all feasible values of its domain on backtracking. | |
ins/2 | The variables in the list Vars are elements of Domain. | |
label/1 | Equivalent to labeling([], Vars) . | |
labeling/2 | Assign a value to each variable in Vars. | |
lex_chain/1 | Lists are lexicographically non-decreasing. | |
scalar_product/4 | True iff the scalar product of Cs and Vs is in relation Rel to Expr. | |
serialized/2 | Describes a set of non-overlapping tasks. | |
sum/3 | The sum of elements of the list Vars is in relation Rel to Expr. | |
transpose/2 | Transpose a list of lists of the same length. | |
tuples_in/2 | True iff all Tuples are elements of Relation. | |
zcompare/3 | Analogous to compare/3, with finite domain variables A and B. | |