2026-07-31T10:19:19Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/531602024-11-26T15:19:15Zcom_20.500.14352_14col_20.500.14352_21

00925njm 22002777a 4500 dc Garmendia Salvador, Luis author Salvador Alcaide, Adela author Montero De Juan, Francisco Javier author 2008-09 A fast method to compute a T-indistinguishability from a reflexive and symmetric fuzzy relation is given for any left-continuous t-norm, taking O(n(3)) time complexity, where n is the number of elements in the universe. It is proved that the computed fuzzy relation is a T-transitive opening when T is the minimum t-norm or a strictly growing t-norm. As far as we know, this is the first known algorithm that computes T-transitive openings preserving the reflexive and symmetric properties. Garmendia, L., Salvador, A., Montero, J.: COMPUTING A T-TRANSITIVE OPENING OF A PROXIMITY. En: Computational Intelligence in Decision and Control. pp. 157-162. WORLD SCIENTIFIC, Madrid, Spain (2008) 978-981-279-946-3 10.1142/9789812799470_0026 https://hdl.handle.net/20.500.14352/53160 https//doi.org/10.1142/9789812799470_0026 http://eproceedings.worldscinet.com/9789812799470/9789812799470_0026.html Computing a T-transitive opening of a proximity