Premium
A method to make some fuzzy relations T ‐transitive
Author(s) -
Garmendia Luis,
del Campo Cristina,
Cubillo Susana,
Salvador Adela
Publication year - 1999
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/(sici)1098-111x(199909)14:9<873::aid-int1>3.0.co;2-y
Subject(s) - transitive relation , computer science , artificial intelligence , fuzzy logic , mathematics , combinatorics
Abstract A new method is given for a finite reflexive relation with a fixed set of properties and a t‐norm T , so that a different, but similar, T ‐transitive relation could be found. The transitive closure is greater than the given relation; however, the T ‐transitivized relation defined in this article is less than or equal to the original one, while reaching or maintaining, in this case, the T ‐conditionality. The algorithm also verifies if a relation is T ‐transitive. ©1999 John Wiley & Sons, Inc.