back to table of contents
   
title:
 
On the transitive closure of reciprocal [0, 1]-valued relations
publication:
 
EUSFLAT
part of series:
  Advances in Intelligent Systems Research
pages:   1015 - 1021
DOI:
  To be assigned soon (how to use a DOI)
author(s):
 
Steven Freson
publication date:
 
July 2011
keywords:
 
Preference relation, reciprocal relation, stochastic transitivity, transitive closure.
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.
copyright:
 
© Atlantis Press. This article is distributed under the terms of the Creative Commons Attribution License, which permits non-commercial use, distribution and reproduction in any medium, provided the original work is properly cited.
full text: