Veuillez utiliser cette adresse pour citer ce document :
http://dspace.cu-barika.dz/jspui/handle/123456789/496
Affichage complet
Élément Dublin Core | Valeur | Langue |
---|---|---|
dc.contributor.author | Hassane, Bouremel | - |
dc.date.accessioned | 2023-05-28T21:37:07Z | - |
dc.date.available | 2023-05-28T21:37:07Z | - |
dc.date.issued | 2016-11-07 | - |
dc.identifier.citation | 13 | en_US |
dc.identifier.issn | 1735-0654 | - |
dc.identifier.uri | http://dspace.cu-barika.dz/jspui/handle/123456789/496 | - |
dc.description.abstract | Abstract. In a recent paper, De Baets et al. have characterized the fuzzy tolerance and fuzzy equivalence relations that a given strict order relation is compatible with. In this paper, we generalize this characterization by consider- ing an arbitrary (crisp) relation instead of a strict order relation, while paying attention to the particular cases of a reflexive or irreflexive relation. The rea- soning largely draws upon the notion of the clone relation of a (crisp) relation, introduced recently by Bouremel et al., and the partition of this clone relation in terms of three different types of pairs of clones. More specifically, reflexive related clones and irreflexive unrelated clones turn out to play a key role in the characterization of the fuzzy tolerance and fuzzy equivalence relations that a given (crisp) relation is compatible with. | en_US |
dc.publisher | Iranian Journal of Fuzzy Systems | en_US |
dc.subject | Crisp relation, Fuzzy relation, Clone relation, Compatibility, Tolerance relation, Equivalence relatio | en_US |
dc.subject | Tolerance relation, Equivalence relatio | en_US |
dc.title | ON THE COMPATIBILITY OF A CRISP RELATION WITH A FUZZY EQUIVALENCE RELATION | en_US |
dc.type | Article | en_US |
Collection(s) : | Department of Maths - قسم الرياضيات |
Fichier(s) constituant ce document :
Fichier | Description | Taille | Format | |
---|---|---|---|---|
ON THE COMPATIBILITY OF A CRISP RELATION WITH A.pdf | 335,58 kB | Adobe PDF | Voir/Ouvrir |
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.