Searched refs:cardinality (Results 1 - 24 of 24) sorted by relevance

/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dcardinal_comments.pl37 on sets cardinality and other optional set functions (minimum and maximum for
50 function of one or more sets (e.g. the cardinality of a set). For instance, the
51 goal of many problems is to maximise or minimise the cardinality of a set. Even
53 to a fixed cardinality or a stricter cardinality domain than just the one inferred
54 by the domain of a set variable (for instance, the cardinality of a set may have
63 The cardinality of a set S, given as a finite domain variable C (#S=C), is not a
64 bijective function since two distinct sets may have the same cardinality. Still,
67 A simple inference that can be done using cardinality information is to instantiate
68 the set to one of the set bounds, when it is known that the set cardinality mus
540 cardinality: FunctionValue can be an integer, an FD variable or an integer domain (list or range) label
583 cardinality: FunctionValue can be an integer, an FD variable or an integer domain (list or range) label
1263 cardinality: "Cardinality function (an integer or an FD variable).", label
[all...]
H A Dcardinal_functions.pl46 % Inferences for Set's cardinality function.
61 % the cardinality of one of its bounds, assign Set to that bound.
78 (member_remove(Functions, cardinality:Card, Fs1) ->
99 (member_remove(Functions,cardinality:Card,Fs1) -> true ; Fs1=Functions),
111 (member_remove(Functions, cardinality:Card, Fs1) ->
112 cardinality(S, C1),
H A Dcardinal_minmax.pl49 cardinality(Set, CardSet),
63 % Force Set (with cardinality CardSet) to have only integers.
82 % CardSet is Set's cardinality.
133 cardinality(Set, CardSet),
148 % CardSet is Set's cardinality.
H A Dcardinal_union.pl83 cardinality(SetVar, CS),
84 cardinality(UnionVar, CU),
90 % cardinality(SetVar, CS),
91 % cardinality(UnionVar, CU),
373 % Check if SetVar with cardinality CardSet is consistent with union cardinality CardUnion,
405 % possible to obtain an extra union cardinality of at least CardUnionPoss with
435 % possible to obtain an extra union cardinality of at least CardUnionPoss with
466 % possible to obtain an extra union cardinality of at least NeccessaryCard with
487 % possible to obtain an extra union cardinality o
[all...]
H A Dcardinal_util.pl89 % cardinality of SetAny. All sets are ordered lists.
119 % cardinality of SetBoth. All sets are ordered lists.
163 % cardinality of NewSet. All sets are ordered lists.
194 % Dom is an integer cardinality domain (list). NU is the universe cardinality.
H A Dmap.pl255 % finite map Map. Note that the cardinality (length) of the domain and
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/
H A Ddatabase-lst.tex53 \item[cardinality(+RelationName, ?Count)]{Get the number of tuples in a relation.}
54 \index{cardinality/2}
H A Ddatabase-sec.tex366 The arity and cardinality (number of tuples) of a relation may
368 \index{arity/2} \index{cardinality/2}
370 ?- arity(manager, Ary), cardinality(manager, NoTups).
H A Dknowbase-sec.tex216 \paragraph{ cardinality(Relation\_Name, Nclauses) } returns the number of
217 \index{cardinality/2}
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/
H A Dfdsets.tex103 \item a finite domain indicating the admissible cardinality for the set
142 Card is the cardinality of the integer set Set
252 #(S,3) % constrain their cardinality
256 #(S1 /\ S2, C), % constrain the cardinality
H A Dextconjunto.tex223 {\em S} is a set term and {\em C} its cardinality. C can be a free
225 predicate is a mean to access the set cardinality and attach it to C.
226 If not, the cardinality of S is constrained to be C.
270 If now we add one cardinality constraint:
292 In the second example an additional constraint restricts the cardinality of
394 criteria mainly concern the cardinality or the weight of a set term.
396 {\bf fd} optimization predicates upon the set cardinality or the set
464 % constrains the cardinality of each set variable to be equal to V (=3)
477 all the domain variables are created, we constrain their cardinality
514 upper bound cardinality an
[all...]
H A Dfdglobal.tex72 The \aboutidx{global cardinality constraint} makes sure certain values
H A Dintroduction.tex104 to reason about sets and set cardinality \cite{gervet}\footnote{
H A Dextfd.tex615 The cardinality operator.
H A Dgfd.tex740 in Bounds (global cardinality constraint).
H A Dobsman.tex720 The cardinality operator.
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Dsetsolver.tex106 \item a finite domain variable indicating the admissible cardinality for the set
115 \index{cardinality constraint}
118 The membership (in/2, notin/2) and cardinality constraints
130 \index{\#/2@\texttt{\#/2}!ic_sets} Card is the cardinality of the integer set Set
304 #(S,3) % constrain their cardinality
308 #(S1 /\verb.\. S2, C), % constrain the cardinality
H A Dsolversintro.tex137 cardinality and weight constraints. For those, the {\em ic_sets} library
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/
H A Dconjunto.pl98 summary:"Var is the cardinality of the set term Sterm.
102 desc:html(" Var is the cardinality of the set term Sterm. If Sterm is a known set
103 and Var is free, Var is instanciated to the cardinality of Sterm. If
104 both are known, the predicate checks that Var is the cardinality of
106 variable representing the set term cardinality. The predicate is
109 it checks that Var contains the cardinality of Sterm. It might infer a
H A Dset.pl429 /*-------------------------------------------------------cardinality operator-*/
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Ddb.pl79 arity/2, cardinality/2, del_tup/1, del_tup/2, del_tup/3,
238 /* cardinality of relation */
239 cardinality( Rel, Ntups) :-
240 cardinality( Rel, Ntups, 0).
242 cardinality( Rel, Ntups, Database) :-
921 ondb(cardinality(Rel, Arity), DB, _) :- !, cardinality( Rel, Arity, DB).
H A Dkb.pl193 cardinality( Rel, Cls),
H A Dfd.pl3259 summary:"The cardinality operator",
3268 cardinality operator. CstList is a list of constraint
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/ech/
H A Dbool.pl163 % Boolean cardinality operator

Completed in 90 milliseconds