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

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název periodika

INFORMATION SCIENCES

ISSN

0020-0255

e-ISSN

—

Svazek periodika

462

Číslo periodika v rámci svazku

SEP

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

7

Strana od-do

367-373

Kód UT WoS článku

000443666300021

EID výsledku v databázi Scopus

2-s2.0-85048763244