Uses of Interface
org.jacop.api.SatisfiedPresent

Packages that use SatisfiedPresent
  • Uses of SatisfiedPresent in org.jacop.constraints

    Classes in org.jacop.constraints that implement SatisfiedPresent
    Modifier and Type
    Class
    Description
    class 
    Constraints |X| #= Y
    class 
    Alldiff constraint assures that all FDVs has different values.
    class 
    Alldifferent constraint assures that all FDVs has differnet values.
    class 
    Alldistinct constraint assures that all FDVs have different values.
    class 
    Among constraint in its simplest form.
    class 
    Among constraint in its general form.
    class 
    Constraint c1 /\ c2 ...
    class 
    If both a and b are equal 1 then result variable is equal 1 too.
    class 
    If all x's are equal 1 then result variable is equal 1 too.
    class 
    ArgMax constraint provides the index of the maximum variable from all variables on the list.
    class 
    ArgMin constraint provides the index of the maximum variable from all variables on the list.
    class 
    Assignment constraint implements facility to improve channeling constraints between dual viewpoints of permutation models.
    class 
    AtLeast constraint implements the counting over number of occurrences of a given value in a list of variables.
    class 
    AtMost constraint implements the counting over number of occurrences of a given value in a list of variables.
    class 
    I defines a boolean clause for 0/1 variables x_i and y_i.
    class 
    Channel constraints "constraint" <=> B
    class 
    Circuit constraint assures that all variables build a Hamiltonian circuit.
    class 
    Conditional constraint implements conditional constraint satisfiability.
    class 
    Count constraint implements the counting over number of occurrences of a given value in a list of variables.
    class 
    CountBounds constraint implements the counting over number of occurrences of a given value in a list of variables.
    class 
    CountValues constraint implements the counting over numbers of occurrences of a given vector of values in a list of variables.
    class 
    CountValuesBounds constraint implements the counting over numbers of occurrences of a given vector of values in a list of variables.
    class 
    CountVar constraint implements the counting over number of occurrences of a given value in a list of variables.
    class 
    Cumulative implements the cumulative/4 constraint using edge-finding algorithm and profile information on the resource use.
    class 
    Diff constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
    class 
    Diff2 constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
    class 
    Disjoint constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
    class 
    DisjointConditional constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
    class 
    Constraint |X - Y| #= Z
    class 
    ElementInteger constraint defines a relation list[index - indexOffset] = value.
    class 
    ElementIntegerFast constraint defines a relation list[index - indexOffset] = value.
    class 
    ElementVariable constraint defines a relation list[index - indexOffset] = value.
    class 
    ElementVariableFast constraint defines a relation list[index - indexOffset] = value.
    class 
    Constraint "constraint1"#<=> "constraint2"
    class 
    If all x's are equal to each other then result variable is equal 1.
    class 
    Extensional constraint assures that one of the tuples is enforced in the relation.
    class 
    GCC constraint counts the number of occurences of given values in x variables.
    class 
    Constraint if constraint1 then constraint2
    class 
    Constraint ( X => Y ) <=> Z.
    class 
    Constraint if constraint1 then constraint2 else constraint3 *
    class 
    Constraint b => c (implication or half-reification)
    class 
    Constraints X to belong to a specified domain.
    class 
    It constructs a LexOrder (lexicographical order) constraint.
    class 
    Deprecated.
    As of release 4.3.1 replaced by LinearInt constraint.
    class 
    LinearInt constraint implements the weighted summation over several variables .
    class 
    LinearIntDom constraint implements the weighted summation over several variables.
    class 
    Max constraint implements the Maximum/2 constraint.
    class 
    MaxSimple constraint implements the Maximum/2 constraint.
    class 
    Member constraint implements the membership of element e on list x.
    class 
    Min constraint implements the minimum/2 constraint.
    class 
    MinSimple constraint implements the minimum/2 constraint.
    class 
    Constraint "not costraint"
    class 
    Constraint c1 \/ c2 \/ ...
    class 
    If at least one variable is equal 1 then result variable is equal 1 too.
    class 
    If at least one variable from the list is equal 1 then result variable is equal 1 too.
    class 
    Standard unified interface for all primitive constraints.
    class 
    Reified constraints "constraint" <=> B
    class 
    Subcircuit constraint assures that all variables build a subcircuit.
    class 
    Deprecated.
    As of release 4.3.1 replaced by SumInt constraint.
    class 
    SumBool constraint implements the summation over several 0/1 variables.
    class 
    SumInt constraint implements the summation over several variables.
    class 
    SumWeight constraint implements the weighted summation over several variables .
    class 
    Deprecated.
    As of release 4.3.1 replaced by LinearIntDom constraint.
    class 
    It defines Value Precedence constraint for integers.
    class 
    Constraint Values counts number of different values on a list of Variables.
    class 
    Constraint X div Y #= Z
    class 
    Constraints X #= C
    class 
    Constraints X #= Y
    class 
    Constraint X ^ Y #= Z
    class 
    Constraint X > C
    class 
    Constraints X >= C
    class 
    Constraints X >= Y
    class 
    Constraint X > Y
    class 
    Constraint X < C
    class 
    Constraint X <= C
    class 
    Constraint X <= Y
    class 
    Constraint X < Y
    class 
    Constraint X mod Y = Z
    class 
    Constraint X * C #= Z
    class 
    Constraint X * Y #= C
    class 
    Constraint X * Y #= Z
    class 
    Constraints X #\= C
    class 
    Constraints X #\= Y
    class 
    Xor constraint - xor("constraint", B).
    class 
    Constraint ( x_0 xor x_1 xor ...
    class 
    Constraint X + C #= Z.
    class 
    Constraints X + C<= Z.
    class 
    Constraint X + Y #= C
    class 
    Constraint X + Y = Z
    class 
    Constraint X + Y> C
    class 
    Constraint X + Y=< Z
  • Uses of SatisfiedPresent in org.jacop.constraints.binpacking

    Modifier and Type
    Class
    Description
    class 
    Binpacking constraint implements bin packing problem.
  • Uses of SatisfiedPresent in org.jacop.constraints.knapsack

    Modifier and Type
    Class
    Description
    class 
    It specifies a knapsack constraint.
  • Uses of SatisfiedPresent in org.jacop.constraints.table

    Modifier and Type
    Class
    Description
    class 
    SimpleTable implements the table constraint using a method presented in
  • Uses of SatisfiedPresent in org.jacop.floats.constraints

    Modifier and Type
    Class
    Description
    class 
    Constraints |P| #= R
    class 
    Constraints acos(P) = R
    class 
    Constraints asin(P) = R
    class 
    Constraints atan(P) = R
    class 
    Constraints cos(P) = R
    class 
    ElementFloat constraint defines a relation list[index - indexOffset] = value.
    class 
    ElementFloatVariable constraint defines a relation list[index - indexOffset] = value.
    class 
    Constraints exp(P) #= Q for P and Q floats
    class 
    LinearFloat constraint implements the weighted summation over several Variable's .
    class 
    Constraints Ln(P) #= Q for P and Q floats
    class 
    Max constraint implements the Maximum/2 constraint.
    class 
    Min constraint implements the minimum/2 constraint.
    class 
    Constraint P / C = R for floats
    class 
    Constraint P / Q = R for floats
    class 
    Constraints P #= C
    class 
    Constraints P #= Q for P and Q floats
    class 
    Constraint P > C
    class 
    Constraints P >= C for floats
    class 
    Constraints P >= Q for floats
    class 
    Constraint P > Q for floats
    class 
    Constraint P < C for floats
    class 
    Constraint X <= C for floats
    class 
    Constraint P <= Q for floats
    class 
    Constraint P < Q for floats
    class 
    Constraint P - C = R
    class 
    Constraint P - Q = R
    class 
    Constraint P * C = R for floats
    class 
    Constraint P * Q = R for floats
    class 
    Constraints P != C
    class 
    Constraints P #= Q for P and Q floats
    class 
    Constraint P + C #= R
    class 
    Constraint P + Q = R
    class 
    Constraints sin(P) = R
    class 
    Constraint sqrt(P) = R for floats
    class 
    SumFloat constraint implements the weighted summation over several Variable's .
    class 
    Constraints sin(P) = R
    class 
    Constraints X #= P for X and P floats
  • Uses of SatisfiedPresent in org.jacop.floats.constraints.linear

    Modifier and Type
    Class
    Description
    class 
    Linear constraint implements the weighted summation over several Variable's .
  • Uses of SatisfiedPresent in org.jacop.satwrapper

    Classes in org.jacop.satwrapper that implement SatisfiedPresent
    Modifier and Type
    Class
    Description
    final class 
    wrapper to communicate between SAT solver and CP solver.
  • Uses of SatisfiedPresent in org.jacop.set.constraints

    Modifier and Type
    Class
    Description
    class 
    It creates a constraints that subtracts from set variable A the elements from of the set variable B and assigns the result to set variable C.
    class 
    The disjoint set constraint makes sure that two set variables do not contain any common element.
    class 
    It creates an equality constraint to make sure that two set variables have the same value.
    class 
    It creates an equality constraint to make sure that a set variable is equal to a given set.
    class 
    It creates a constraint that makes sure that the set value of set variable A is included in the set value of set variable B.
    class 
    It creates a constraint that makes sure that value of the variable A is included within a provided set.
    class 
    It creates a constraint that makes sure that A intersected with B is equal to C.
    class 
    It creates a <= b constraint on two set variables.
    class 
    It creates a < b constraint on two set variables.
    class 
    It creates a constraint that makes sure that A union B is equal to C.
    class 
    The set cardinality constraint.
    class 
    The set cardinality constraint.
    class 
    It constructs a constraint which makes sure that a given element is in the domain of the set variable.
    class 
    It is an element constraint that make sure that set variable value has a domain equal to the index-th element of the supplied list of sets.
    class 
    This constraint matches the elements of the given set variable onto a list of integer variables.
    class 
    It creates an inclusion set constraint to make sure that provided set is included in a set variable a.
    class 
    It computes a weighted sum of the elements in the domain of the given set variable.
    class 
    It creates a constraint that makes sure that the value assigned to the integer variable x is the only element of the set assigned to a set variable a.
    class 
    It creates a constraint that makes sure that the value assigned to integer variable x is included in the set assigned to the set variable a.