On the transitive closure of reciprocal [0, 1]-valued relations

Abstract

We build a theoretical framework that enables to extend the concept of transitive closure to the class of complete crisp relations, the class of reciprocal 3-valued relations and the class of reciprocal [0, 1]valued relations. We present algorithms to compute the transitive closure of reciprocal [0, 1]-valued relations, where the type of transitivity is either weak stochastic transitivity or strong stochastic transitivity.