Fuzzy Aggregation Operators on Bounded Lattices

Fuzzy aggregation operators on bounded lattices provide a unifying algebraic framework for combining uncertain or imprecise information. A bounded lattice supplies a generalised domain in which each pair of elements has a greatest lower bound and a least upper bound, extending the classical unit interval structure. Within this setting, aggregation operators—such as triangular norms (t-norms) and their duals, triangular conorms (t-conorms)—are required to satisfy properties of monotonicity, associativity and boundary conditions that model logical conjunctions and disjunctions respectively. More complex constructions, including nullnorms and means, enrich the toolbox for synthesising fuzzy values. Generator functions enable the systematic derivation of continuous Archimedean operators, while ordinal-sum techniques permit the patching of distinct operators across subintervals of the lattice. Together, these developments have led to flexible parameterisations that can be tailored to diverse decision-making, control and information-fusion applications. Research continues to explore structural properties—such as distributivity with respect to lattice operations—and to generalise beyond linearly ordered lattices, thereby widening the scope of practical deployment in areas such as multi-criteria evaluation, image processing and computational intelligence.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Research from all publishers

Recent studies have advanced weighted aggregation systems by integrating expectation-level weighting transformations with generator-induced operators, allowing decision-maker preferences to be encoded directly as interval-valued weights and yielding robust interval scores for alternative evaluation. Parallel work has introduced a new parametric family of t-norms and t-conorms whose additive generators take the form of an arctangent of a linear fractional function, thus broadening the spectrum of continuous operators available for fuzzy modelling and control. Additionally, the theory of ordinal sums has been extended from univariate triangular norms to the construction of bi- and multivariate copulas, utilising gluing and grid-patchwork techniques to assemble complex dependence models from simpler fuzzy building blocks. These contributions underscore a trend towards highly customisable aggregation frameworks that retain rigorous algebraic foundations.

Fuzzy Aggregation Operators on Bounded Lattices publication trend

The graph below shows the total number of articles in fuzzy aggregation operators on bounded lattices across all publications each year (not limited to Nature Index journals).

Technical terms

Bounded lattice: A partially ordered set with a least element and a greatest element in which any two elements have a unique meet (greatest lower bound) and join (least upper bound).

Fuzzy aggregation operator: A mapping that combines several fuzzy values into a single fuzzy value while preserving monotonicity and other desired algebraic properties.

T-norm: A commutative, associative and increasing binary operator on a bounded lattice with the greatest element as identity, modelling fuzzy intersection.

T-conorm: The dual of a t-norm, a commutative, associative and increasing binary operator with the least element as identity, modelling fuzzy union.

Ordinal sum: A method of constructing a new aggregation operator by partitioning the lattice domain into subintervals and applying different operators on each subinterval.

References

1. Weighted aggregation systems and an expectation level-based weighting and scoring procedure. European Journal of Operational Research (2022).
2. A Parametric Family of Triangular Norms and Conorms with an Additive Generator in the Form of an Arctangent of a Linear Fractional Function. Computation (2023).
3. New Constructions of Nullnorms on Bounded Lattices. Journal of Applied Mathematics and Physics (2020).
4. Ordinal sums: From triangular norms to bi- and multivariate copulas. Fuzzy Sets and Systems (2022).
5. On the property of T-distributivity. Fixed Point Theory and Algorithms for Sciences and Engineering (2013).