dist/doc/implementation.tex

857 then the transitive closure $R^+$ of $R$ is the union
864 Alternatively, the transitive closure may be defined
872 Since the transitive closure of a polyhedral relation
875 of the transitive closure.
880 to be as close as possible to the actual transitive closure
884 For computing an approximation of the transitive closure of $R$,
897 The transitive closure is then
1170 transitive closure:
1283 results in the exact transitive closure
1363 The approximation $T$ for the transitive closure $R^+$ can be obtained
1486 the transitive closure, skipping the decomposition.
1661 \textcite{Kelly1996closure}, with the transitive closure operation
1682     $R_{rr} \coloneqq R_{rr}^+$ \nllabel{l:Floyd:closure}\;
1711 $R_{pq}$ as the transitive closure of $R$.
1727 The transitive closure in Line~\ref{l:Floyd:closure}
1753 \protect\textcite{Beletska2009} and its transitive closure}
1799 The transitive closure of the original relation is then equal to
1806 In some cases it is possible and useful to compute the transitive closure
1813 then we can pick some $R_i$ and compute the transitive closure of $R$ as
1825 closure in \eqref{eq:transitive:incremental} be representable
1828 the number of disjuncts in the argument of the transitive closure
1844 and range of the transitive closure are part of ${\cal C}(R_i,D)$,
1963 if all of the transitive closure operations involved are exact.
1964 If, say, the second transitive closure in \eqref{eq:transitive:incremental}
1971 designed to compute and underapproximation of the transitive closure,
1994 The transitive closure of such a ``d-form'' relation is
2005 The domain and range of this transitive closure are then