<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-07-31T10:19:00Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/53160" metadataPrefix="qdc">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/53160</identifier><datestamp>2024-11-26T15:19:15Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_21</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Computing a T-transitive opening of a proximity</dc:title>
   <dc:creator>Garmendia Salvador, Luis</dc:creator>
   <dc:creator>Salvador Alcaide, Adela</dc:creator>
   <dc:creator>Montero De Juan, Francisco Javier</dc:creator>
   <dc:contributor>Ruan, Da</dc:contributor>
   <dc:contributor>Montero De Juan, Francisco Javier</dc:contributor>
   <dcterms:abstract>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.</dcterms:abstract>
   <dcterms:dateAccepted>2023-06-20T13:38:30Z</dcterms:dateAccepted>
   <dcterms:available>2023-06-20T13:38:30Z</dcterms:available>
   <dcterms:created>2023-06-20T13:38:30Z</dcterms:created>
   <dcterms:issued>2008-09</dcterms:issued>
   <dc:type>book part</dc:type>
   <dc:identifier>https://hdl.handle.net/20.500.14352/53160</dc:identifier>
   <dc:identifier>XXXX-XXXX</dc:identifier>
   <dc:identifier>10.1142/9789812799470_0026</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>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)</dc:relation>
   <dc:rights>restricted access</dc:rights>
   <dc:publisher>World Scientific</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>