<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-04589444</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-17T03:18:29+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A survey on the enumeration of classes of logical connectives and aggregation functions defined on a finite chain, with new results</title>
            <author role="aut">
              <persName>
                <forename type="first">Marc</forename>
                <surname>Munar</surname>
              </persName>
              <email type="md5">71b94d8484cd643cb1c6d045ddef1003</email>
              <email type="domain">uib.es</email>
              <idno type="idhal" notation="numeric">1385995</idno>
              <idno type="halauthorid" notation="string">3157896-1385995</idno>
              <affiliation ref="#struct-305409"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Miguel</forename>
                <surname>Couceiro</surname>
              </persName>
              <email type="md5">f529b06ac4780b9b07b39d207edbf60f</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">miguel-couceiro</idno>
              <idno type="idhal" notation="numeric">1498</idno>
              <idno type="halauthorid" notation="string">17246-1498</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2316-7623</idno>
              <idno type="IDREF">https://www.idref.fr/223362395</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=6w-xX8sAAAAJ</idno>
              <affiliation ref="#struct-1099257"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sebastia</forename>
                <surname>Massanet</surname>
              </persName>
              <email type="md5">2912a35ea65a42fa9db504c4b473a144</email>
              <email type="domain">uib.es</email>
              <idno type="idhal" notation="numeric">1385996</idno>
              <idno type="halauthorid" notation="string">3157897-1385996</idno>
              <affiliation ref="#struct-305409"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Daniel</forename>
                <surname>Ruiz-Aguilera</surname>
              </persName>
              <email type="md5">557d1afbaa23dd680ca01bca546f4c98</email>
              <email type="domain">uib.es</email>
              <idno type="idhal" notation="numeric">1385997</idno>
              <idno type="halauthorid" notation="string">3157898-1385997</idno>
              <affiliation ref="#struct-305409"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Miguel</forename>
                <surname>Couceiro</surname>
              </persName>
              <email type="md5">1090c3ea2d8280fa0028311c6ba45d22</email>
              <email type="domain">loria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2024-05-27 15:48:50</date>
              <date type="whenModified">2025-11-04 12:02:47</date>
              <date type="whenReleased">2024-05-28 09:43:03</date>
              <date type="whenProduced">2024</date>
              <date type="whenEndEmbargoed">2024-05-27</date>
              <ref type="file" target="https://inria.hal.science/hal-04589444v1/document">
                <date notBefore="2024-05-27"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-04589444v1/file/Enumeration_of_discrete_operators__Revision_V1_.pdf" id="file-4589444-3982212">
                <date notBefore="2024-05-27"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="304220">
                <persName>
                  <forename>Miguel</forename>
                  <surname>Couceiro</surname>
                </persName>
                <email type="md5">1090c3ea2d8280fa0028311c6ba45d22</email>
                <email type="domain">loria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04589444</idno>
            <idno type="halUri">https://inria.hal.science/hal-04589444</idno>
            <idno type="halBibtex">munar:hal-04589444</idno>
            <idno type="halRefHtml">&lt;i&gt;Fuzzy Sets and Systems&lt;/i&gt;, In press, &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.fss.2024.109023"&gt;&amp;#x27E8;10.1016/j.fss.2024.109023&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Fuzzy Sets and Systems, In press, &amp;#x27E8;10.1016/j.fss.2024.109023&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-4589444-3982212"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="LORIA">Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
            <idno type="stamp" n="LORIA-NLPKD" corresp="LORIA">Department of Natural Language Processing &amp; Knowledge Discovery</idno>
            <idno type="stamp" n="AM2I-UL">Pôle scientifique Automatique, Mathématiques, Informatique et leurs Intéractions de l'Université de Lorraine</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A survey on the enumeration of classes of logical connectives and aggregation functions defined on a finite chain, with new results</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Marc</forename>
                    <surname>Munar</surname>
                  </persName>
                  <email type="md5">71b94d8484cd643cb1c6d045ddef1003</email>
                  <email type="domain">uib.es</email>
                  <idno type="idhal" notation="numeric">1385995</idno>
                  <idno type="halauthorid" notation="string">3157896-1385995</idno>
                  <affiliation ref="#struct-305409"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Miguel</forename>
                    <surname>Couceiro</surname>
                  </persName>
                  <email type="md5">f529b06ac4780b9b07b39d207edbf60f</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">miguel-couceiro</idno>
                  <idno type="idhal" notation="numeric">1498</idno>
                  <idno type="halauthorid" notation="string">17246-1498</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2316-7623</idno>
                  <idno type="IDREF">https://www.idref.fr/223362395</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=6w-xX8sAAAAJ</idno>
                  <affiliation ref="#struct-1099257"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sebastia</forename>
                    <surname>Massanet</surname>
                  </persName>
                  <email type="md5">2912a35ea65a42fa9db504c4b473a144</email>
                  <email type="domain">uib.es</email>
                  <idno type="idhal" notation="numeric">1385996</idno>
                  <idno type="halauthorid" notation="string">3157897-1385996</idno>
                  <affiliation ref="#struct-305409"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Daniel</forename>
                    <surname>Ruiz-Aguilera</surname>
                  </persName>
                  <email type="md5">557d1afbaa23dd680ca01bca546f4c98</email>
                  <email type="domain">uib.es</email>
                  <idno type="idhal" notation="numeric">1385997</idno>
                  <idno type="halauthorid" notation="string">3157898-1385997</idno>
                  <affiliation ref="#struct-305409"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">13513</idno>
                <idno type="issn">0165-0114</idno>
                <title level="j">Fuzzy Sets and Systems</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <date type="datePub" subtype="inPress">2024</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.fss.2024.109023</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">logical connectives</term>
                <term xml:lang="en">aggregation functions</term>
                <term xml:lang="en">finite chains</term>
                <term xml:lang="en">enumeration</term>
                <term xml:lang="en">discrete t-norms</term>
                <term xml:lang="en">discrete implications</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The enumeration of logical connectives and aggregation functions defined on a finite chain has been a hot topic in the literature for the last decades. Multiple advantages can be derived from knowing a general formula about their cardinality, for instance, the ability to anticipate the computational cost required for generating operators with different properties. This is of paramount importance in image processing and decision making scenarios, where the identification of the most optimal operator is essential. Furthermore, it facilitates the examination of how constraining a certain property is in relation to its parent class. As a consequence, this paper aims to compile the main existing formulas and the methodologies with which they have been derived. Additionally, we introduce some novel formulas for the number of smooth discrete aggregation functions with neutral element or absorbing element, idempotent conjunctions, and commutative and idempotent conjunctions.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-305409" status="VALID">
          <idno type="ROR">https://ror.org/03e10x626</idno>
          <orgName>Universitat de les Illes Balears = Universidad de las Islas Baleares = University of the Balearic Islands</orgName>
          <orgName type="acronym">UIB</orgName>
          <desc>
            <address>
              <addrLine>Cra. de Valldemossa, km 7.5. Palma Illes Balears</addrLine>
              <country key="ES"/>
            </address>
            <ref type="url">http://www.uib.cat</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-1099257" status="VALID">
          <orgName>Knowledge representation, reasonning</orgName>
          <orgName type="acronym">ORPAILLEUR</orgName>
          <date type="start">2020-06-30</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://orpailleur.loria.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-423086" type="direct"/>
            <relation active="#struct-206040" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="department" xml:id="struct-423086" status="VALID">
          <orgName>Department of Natural Language Processing &amp; Knowledge Discovery</orgName>
          <orgName type="acronym">LORIA - NLPKD</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr/en/research/departments/natural-language-processing-and-knowledge-discovery/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-206040" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-206040" status="VALID">
          <idno type="IdRef">067077927</idno>
          <idno type="ISNI">0000000121795429</idno>
          <idno type="RNSR">198912571S</idno>
          <idno type="IdUnivLorraine">[UL]RSI--</idno>
          <idno type="ROR">https://ror.org/02vnf0c38</idno>
          <orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
          <orgName type="acronym">LORIA</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-413289" type="direct"/>
            <relation name="UMR7503" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-413289" status="VALID">
          <idno type="IdRef">157040569</idno>
          <idno type="IdUnivLorraine">[UL]100--</idno>
          <idno type="ROR">https://ror.org/04vfs2w97</idno>
          <orgName>Université de Lorraine</orgName>
          <orgName type="acronym">UL</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lorraine.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>