We consider the question of taking transitive closures on top of pure relational systems (Sybase and Ingres in this case). We developed three kinds of transitive closure programs , one using a stored procedure to simulate a built-in transitive closure operator, one using the C language embedded with SQL statements to simulate the iterated execution of the transitive closure operation, and one u...

The transitive closure of a reflexive, symmetric, analytic relation is an analytic equivalence relation. Does some smaller class contain the transitive closure of every reflexive, symmetric, closed relation? An essentially negative answer is provided here. Every analytic equivalence relation on an arbitrary Polish space is Borel embeddable in the transitive closure of the union of two smooth Bo...

This paper describes a novel event-matching strategy using features obtained from the transitive closure of dependency relations. The method yields a model capable of matching events with an F-measure of 66.5%.

Let Λ be a signature and A = (A, Λ) be an algebra. We say that A is an algebra of binary relations if A ⊆ P(U × U) for some set U and each operation in Λ is interpreted as a natural operation on relations. 0 is the empty set. Other possible operations include reexive-transitive closure * , the residuals \ and / of composition, domain d and range r, etc. Algebras of binary relations Let Λ be a s...

Characterizations of Egalitarian Characterizations of Egalitarian Characterizations of Egalitarian Characterizations of Egalitarian Binary Relations as Transitive Closures Binary Relations as Transitive Closures Binary Relations as Transitive Closures Binary Relations as Transitive Closures-with a special reference to Lo with a special reference to Lo with a special reference to Lo with a speci...