All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Binary generating set of the clone of idempotent aggregation functions on bounded lattices

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F18%3A73591713" target="_blank" >RIV/61989592:15310/18:73591713 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.sciencedirect.com/science/article/pii/S002002551830478X" target="_blank" >https://www.sciencedirect.com/science/article/pii/S002002551830478X</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ins.2018.06.038" target="_blank" >10.1016/j.ins.2018.06.038</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Binary generating set of the clone of idempotent aggregation functions on bounded lattices

  • Original language description

    In a recent paper Botur et al. (2018) we have presented a generating set of the clone of idempotent aggregation functions on bounded lattices. As the main result we have shown that this clone is generated by certain ternary idempotent functions from which all idempotent aggregation functions of L can be obtained by usual term composition. The aim of this paper is to present an essential improvement of the result above by presenting a new generating set of this clone. A bit artificial ternary functions are substituted here by natural (binary) lattice a-medians and certain binary characteristic functions. Consequently, the clone is generated by its binary part and the result strengthens the essential role of medians within all idempotent aggregation functions. Moreover, we will show that for an n-element lattice L, the upper bound of binary generators is 2n 1. (C) 2018 Elsevier Inc. All rights reserved.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    INFORMATION SCIENCES

  • ISSN

    0020-0255

  • e-ISSN

  • Volume of the periodical

    462

  • Issue of the periodical within the volume

    SEP

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    7

  • Pages from-to

    367-373

  • UT code for WoS article

    000443666300021

  • EID of the result in the Scopus database

    2-s2.0-85048763244