On lattices with a smallest set of aggregation functions

DOI10.1016/J.INS.2015.07.031MaRDI QIDQ1750342zbMATH OpenOpenAlexFDO

Authors Radomír Halaš, Jozef Pócs

Publication date 18 May 2018

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.06407

zbMATH Keywords

aggregation functionlatticepolynomialtolerance

Mathematics Subject Classification ID

Structure theory of lattices (06B05)

Abstract: Given a bounded lattice $L$ with bounds $0$ and $1$, it is well known that the set $mathsf{Pol}_{0,1}(L)$ of all $0,1$-preserving polynomials of $L$ forms a natural subclass of the set $mathsfC(L)$ of aggregation functions on $L$. The main aim of this paper is to characterize all finite lattices $L$ for which these two classes coincide, i.e. when the set $mathsfC(L)$ is as small as possible. These lattices are shown to be completely determined by their tolerances, also several sufficient purely lattice-theoretical conditions are presented. In particular, all simple relatively complemented lattices or simple lattices for which the join (meet) of atoms (coatoms) is $1$ ($0$) are of this kind.

Recommendations

• On the clone of aggregation functions on bounded lattices
• On generating of idempotent aggregation functions on finite lattices
• Aggregation functions on bounded partially ordered sets and their classification
• Aggregation on a finite lattice
• On generating sets of the clone of aggregation functions on finite lattices

Cites work

• A new way to extend t-norms, t-conorms and negations
• Absorbent tuples of aggregation operators
• Aggregation functions on bounded partially ordered sets and their classification
• Aggregation functions.
• Aggregation on Boolean multi-polar space: knowledge-based vs. category-based ordering
• Aggregation operators. New trends and applications
• Bimigrativity of binary aggregation functions
• Extension of fuzzy logic operators defined on bounded lattices via retractions
• Generators of copulas and aggregation
• scientific article; zbMATH DE number 3987347 (Why is no real title available?)
• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 51636 (Why is no real title available?)
• scientific article; zbMATH DE number 1557989 (Why is no real title available?)
• scientific article; zbMATH DE number 6027082 (Why is no real title available?)
• Lattice Theory: Foundation
• Lattice Theory: Special Topics and Applications
• Many-valued quantum algebras
• Monotone measures and universal integrals in a uniform framework for the scientific impact assessment problem
• Multi-polar t-conorms and uninorms
• On extensions of triangular norms on bounded lattices
• On the extension of lattice-valued implications via retractions
• Sequential aggregation of bags
• Triangular norms on product lattices
• Uninorms on bounded lattices
• Weighted lattice polynomials

Cited in

(14)

• Representation of fuzzy subsets by Galois connections
• On the clone of aggregation functions on bounded lattices
• On the decomposability of aggregation functions on direct products of posets
• Binary generating set of the clone of idempotent aggregation functions on bounded lattices
• On generating sets of the clone of aggregation functions on finite lattices
• Congruences and the discrete Sugeno integrals on bounded distributive lattices
• Description of sup- and inf-preserving aggregation functions via families of clusters in data tables
• On aggregation sets and lower-convex sets
• Aggregation on a finite lattice
• Generalized comonotonicity and new axiomatizations of Sugeno integrals on bounded distributive lattices
• On the minimality of some generating sets of the aggregation clone on a finite chain
• Heterogeneous formal context and its decomposition by heterogeneous fuzzy subsets
• A new characterization of congruences and the discrete Sugeno integral on LB-valued general fuzzy automata
• On generating of idempotent aggregation functions on finite lattices

This page was built for publication: On lattices with a smallest set of aggregation functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1750342)