Lines Matching refs:relations

28 $R$ is a finite union of basic relations
76 $S \in \Z^n \to 2^{\Z^{d_2+d_3}}$ be two relations,
393 {\tt isl} performs such simplifications on all sets and relations.
519 sets and relations in {\tt isl}.  Instead, {\tt isl} represents
828 expressions in the internal representation of sets and relations
921 relations in $R$ as simply adding one or more offsets to a domain element
948 the same as the number of basic relations in $R$.
1003 The path that consists of only identity relations is removed
1006 that the relations we compose in \eqref{eq:transitive:decompose}
1007 each consist of two basic relations.  If there are $m$
1387 forward relations, a special case of acyclic relations.
1424 If the input relation $R$ is a union of several basic relations
1445 This idea can be generalized to relations that are unions
1446 of more than two basic relations by constructing the
1448 the basic relations and an edge between two basic relations
1634 For the other two basic relations, we have both
1653 However, if $R$ is a union of relations that map between different
1662 only being applied to relations from a given domain to itself.
1674 \Output{Updated relations $R_{pq}$ such that each relation
1695 Let the input relation $R$ be a union of $m$ basic relations $R_i$.
1704 We construct $n^2$ relations
1713 all relations $R_{pq}$ to include paths that go from $p$ to $r$,
1807 of union of basic relations incrementally.  In particular,