pith. sign in

arxiv: 1812.09529 · v1 · pith:QBZSC4G7new · submitted 2018-12-22 · 🧮 math.RA

On generating of idempotent aggregation functions on finite lattices

classification 🧮 math.RA
keywords aggregationfunctionsidempotentlatticelatticescertainfinitegenerating
0
0 comments X
read the original abstract

In a recent paper we proposed the study of aggregation functions on lattices via clone theory approach. Observing that aggregation functions on lattices just correspond to $0,1$-monotone clones, we have shown that all aggregation functions on a finite lattice $L$ can be obtained as usual composition of lattice operations $\wedge,\vee$, and certain unary and binary aggregation functions. The aim of this paper is to present a generating set for the class of intermediate (or, equivalently, idempotent) aggregation functions. This set consists of lattice operations and certain ternary idempotent aggregation functions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.