On the minimality of some generating sets of the aggregation clone on a finite chain
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F21%3A73609597" target="_blank" >RIV/61989592:15310/21:73609597 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0020025521002127" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0020025521002127</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ins.2021.02.070" target="_blank" >10.1016/j.ins.2021.02.070</a>
Alternative languages
Result language
angličtina
Original language name
On the minimality of some generating sets of the aggregation clone on a finite chain
Original language description
Clone theory plays an important role in studying aggregation functions on bounded posets or bounded lattices. Several important classes of aggregation functions on a bounded lattice L form a clone, particularly the set of all aggregation functions on L, the so-called full aggregation clone on L. For any finite lattice L, this clone is known to be finitely generated and various generating sets and their constructions have been presented in recent papers. The aim of this paper is to extend previous results concerning generating sets of aggregation clones on finite chains. Namely, the objective is to discuss the minimality of certain generating bases, the so-called (chi,circle plus)-generating sets.
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
2021
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
564
Issue of the periodical within the volume
JUL
Country of publishing house
US - UNITED STATES
Number of pages
9
Pages from-to
193-201
UT code for WoS article
000647651100010
EID of the result in the Scopus database
2-s2.0-85102469148