Title: Computing a Transitive Opening of a Reflexive and Symmetric Fuzzy Relation
Abstract: There are fast algorithms to compute the transitive closure of a fuzzy relation, but there are only a few different algorithms that compute transitive openings from a given fuzzy relation. In this paper a method to compute a transitive opening of a reflexive and symmetric fuzzy relation is given. Even though there is not a unique transitive opening of a fuzzy relation, it is proved that the computed transitive opening closure is maximal.
Publication Year: 2005
Publication Date: 2005-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 4
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot