<?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:24Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/53160" metadataPrefix="rdf">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><rdf:RDF xmlns:rdf="http://www.openarchives.org/OAI/2.0/rdf/" xmlns:ow="http://www.ontoweb.org/ontology/1#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:ds="http://dspace.org/ds/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
   <ow:Publication rdf:about="oai:docta.ucm.es:20.500.14352/53160">
      <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>
      <dc:description>8th International Conference on Fuzzy Logic and Intelligent Technologies in Nuclear Science.
Madrid, Spain, 21-24 September 2008</dc:description>
      <dc:description>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.</dc:description>
      <dc:date>2023-06-20T13:38:30Z</dc:date>
      <dc:date>2023-06-20T13:38:30Z</dc:date>
      <dc:date>2008-09</dc:date>
      <dc:type>book part</dc:type>
      <dc:identifier>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:identifier>
      <dc:identifier>978-981-279-946-3</dc:identifier>
      <dc:identifier>10.1142/9789812799470_0026</dc:identifier>
      <dc:identifier>https://hdl.handle.net/20.500.14352/53160</dc:identifier>
      <dc:identifier>https//doi.org/10.1142/9789812799470_0026</dc:identifier>
      <dc:identifier>http://eproceedings.worldscinet.com/9789812799470/9789812799470_0026.html</dc:identifier>
      <dc:language>eng</dc:language>
      <dc:rights>restricted access</dc:rights>
      <dc:publisher>World Scientific</dc:publisher>
   </ow:Publication>
</rdf:RDF></metadata></record></GetRecord></OAI-PMH>