Results 211 to 220 of about 41,142 (258)
Some of the next articles are maybe not open access.
Information Sciences, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yong Su, Hua-Wen Liu
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yong Su, Hua-Wen Liu
exaly +3 more sources
Journal of Algebra, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haiwei Wang
exaly +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haiwei Wang
exaly +3 more sources
New results on ordinal sum implications based on ordinal sum of overlap functions
Fuzzy Sets and Systems, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kai Li, Yifan Zhao
exaly +3 more sources
A note on simplification of z-ordinal sum construction
Fuzzy Sets and Systems, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrea Zemankova
exaly +2 more sources
The genetic development of ordinal sums
Fuzzy Sets and Systems, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelo Ciaramella +2 more
openaire +2 more sources
Ordinal sum construction for uninorms and generalized uninorms
International Journal of Approximate Reasoning, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrea Zemankova
exaly +2 more sources
Ordinal sums of impartial games
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carvalho, Alda +2 more
openaire +2 more sources
Aequationes mathematicae, 2010
We prove that the ordinal sum of n-copulas is always an n-copula and show that every copula may be represented as an ordinal sum, once the set of its idempotents is known. In particular, it will be shown that every copula can be expressed as the ordinal sum of copulas having only trivial idempotents.
R. Mesiar, SEMPI, Carlo
openaire +3 more sources
We prove that the ordinal sum of n-copulas is always an n-copula and show that every copula may be represented as an ordinal sum, once the set of its idempotents is known. In particular, it will be shown that every copula can be expressed as the ordinal sum of copulas having only trivial idempotents.
R. Mesiar, SEMPI, Carlo
openaire +3 more sources
Ordinal sums by using genetic algorithms
2004 IEEE International Conference on Fuzzy Systems (IEEE Cat. No.04CH37542), 2005A novel approach based on the ordinal sums and genetic algorithms is introduced. The main characteristic of an ordinal sum lies in the use of different t-norms (t-conorms) defined over disjoint subintervals of the unit interval. In this approach, a genetic optimisation environment to construct the ordinal sums and to optimise subintervals, and to ...
Angelo Ciaramella +2 more
openaire +3 more sources
Journal of Mathematical Sciences, 2015
Summary: We prove that for any computable ordinal \(\alpha\) there exists a notation \(a\in O\) and a partial computable function possessing the following property: if \(b\) and \(c\) are given notations in the set \(\{t\in O \mid t
openaire +1 more source
Summary: We prove that for any computable ordinal \(\alpha\) there exists a notation \(a\in O\) and a partial computable function possessing the following property: if \(b\) and \(c\) are given notations in the set \(\{t\in O \mid t
openaire +1 more source