Pub Date : 2026-05-15Epub Date: 2026-01-08DOI: 10.1016/j.fss.2026.109766
Zhenyu Xiu , Xu Zheng
In this paper, we primarily investigate methods for generating uninorms on complete lattices using monotone functions and their pseudo-inverses. First, we present a construction of a uninorm on a complete lattice based on a t-norm, a complete inf-homomorphism, and its pseudo-inverse. Next, we introduce a new method for generating a uninorm via a given uninorm, a complete inf-homomorphism, and its pseudo-inverse. Finally, we explore methods for constructing a uninorm on a complete lattice using a given uninorm together with an injective complete inf-homomorphism and its pseudo-inverse.
{"title":"Construction of uninorms on complete lattices by a monotone function and its pseudo-inverse","authors":"Zhenyu Xiu , Xu Zheng","doi":"10.1016/j.fss.2026.109766","DOIUrl":"10.1016/j.fss.2026.109766","url":null,"abstract":"<div><div>In this paper, we primarily investigate methods for generating uninorms on complete lattices using monotone functions and their pseudo-inverses. First, we present a construction of a uninorm on a complete lattice based on a t-norm, a complete inf-homomorphism, and its pseudo-inverse. Next, we introduce a new method for generating a uninorm via a given uninorm, a complete inf-homomorphism, and its pseudo-inverse. Finally, we explore methods for constructing a uninorm on a complete lattice using a given uninorm together with an injective complete inf-homomorphism and its pseudo-inverse.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109766"},"PeriodicalIF":2.7,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145981151","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-14DOI: 10.1016/j.fss.2026.109772
Chuang Zheng
<div><div>In this paper, we solve the fuzzy linear systems in a fuzzy number space <span><math><mi>X</mi></math></span>, namely the Gaussian probability density membership function (Gaussian-PDMF) space. The fuzzy linear systems include two types: the semi-fuzzy linear system (SFLS) and the fully-fuzzy linear system (FFLS). First, we solve the SFLS <span><math><mrow><mi>A</mi><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow><mo>=</mo><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></mrow></math></span>, where <span><math><mrow><mi>A</mi><mo>∈</mo><msup><mi>R</mi><mrow><mi>m</mi><mo>×</mo><mi>n</mi></mrow></msup></mrow></math></span> is a real-valued matrix, <span><math><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></math></span> is a fuzzy number vector, and <span><math><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow></math></span> is the unknown fuzzy number vector. The elements of both <span><math><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></math></span> and <span><math><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow></math></span> belong to <span><math><mi>X</mi></math></span>. We present the Cramer’s rule to calculate the solution with square matrix <em>A</em> and find out that its solution set is a <span><math><mrow><mn>5</mn><mo>(</mo><mi>n</mi><mo>−</mo><mi>R</mi><mo>(</mo><mi>A</mi><mo>)</mo><mo>)</mo></mrow></math></span> dimensional affine space with <span><math><mrow><mi>A</mi><mo>∈</mo><msup><mi>R</mi><mrow><mi>m</mi><mo>×</mo><mi>n</mi></mrow></msup></mrow></math></span> and <em>R</em>(<em>A</em>) being the rank of <em>A</em>. The explicit form of the solution for RREF matrix <em>A</em> is stated to ensure usability for modeling. Secondly, we solve the FFLS <span><math><mrow><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow><mo>=</mo><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></mrow></math></span>, where <span><math><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow></math></span> is a fuzzy matrix with all components in <span><math><mi>X</mi></math></span>. We analyze its solution set and present the parametric form of solutions under the fuzzy RREF matrix. We then adapt Gaussian elimination method to fuzzy matrices and systems by restricting it to the unit group of ring <span><math><mi>X</mi></math></span>, proving the equivalence of solution sets after elementary row operations. We also establish the connection between FFLS and SFLS by confining elements of <span><math><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow></math></span> to a subset of <span><math><mi>X</mi></math></span> that forms a field. In the third part, two numerical examples are given to illustrated our method. All results in this paper are explicit since the Gaussian-PDMF space <span><math><mi>X</mi></math></span>, to which the membership function of the fuzzy number belongs, possesses a complete algebraic structure. The proposed framework offers a feasible and systematical tool for solving the mathematical m
本文在模糊数空间X，即高斯概率密度隶属函数（Gaussian- pdmf）空间中求解模糊线性系统。模糊线性系统包括半模糊线性系统和全模糊线性系统两种类型。首先，我们求解SFLS Ax ~ =b ~，其中A∈Rm×n为实值矩阵，b ~为模糊数向量，x ~为未知模糊数向量。我们提出了计算具有方阵A的解的Cramer规则，并发现其解集是一个5（n−R(A)）维仿射空间，其中A∈Rm×n， R(A)为A的秩。为了保证建模的可用性，我们给出了RREF矩阵A解的显式形式。其次，我们求解了FFLS A ~ x ~ =b ~，其中A ~是一个所有成分都在x中的模糊矩阵，我们分析了它的解集，并给出了模糊RREF矩阵下解的参数形式。然后将高斯消去法限定在环X的单位群上，将其应用于模糊矩阵和系统，证明了初等行运算后解集的等价性。我们还通过将A ~的元素限定为X的一个子集来建立FFLS和SFLS之间的联系。在第三部分中，给出了两个数值例子来说明我们的方法。由于模糊数的隶属函数所在的高斯- pdmf空间X具有完备的代数结构，所以本文的所有结果都是显式的。该框架为求解具有不确定性和模糊性的模糊线性系统的数学模型提供了一种可行的系统工具。
{"title":"Solving fuzzy linear systems in Gaussian PDMF space","authors":"Chuang Zheng","doi":"10.1016/j.fss.2026.109772","DOIUrl":"10.1016/j.fss.2026.109772","url":null,"abstract":"<div><div>In this paper, we solve the fuzzy linear systems in a fuzzy number space <span><math><mi>X</mi></math></span>, namely the Gaussian probability density membership function (Gaussian-PDMF) space. The fuzzy linear systems include two types: the semi-fuzzy linear system (SFLS) and the fully-fuzzy linear system (FFLS). First, we solve the SFLS <span><math><mrow><mi>A</mi><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow><mo>=</mo><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></mrow></math></span>, where <span><math><mrow><mi>A</mi><mo>∈</mo><msup><mi>R</mi><mrow><mi>m</mi><mo>×</mo><mi>n</mi></mrow></msup></mrow></math></span> is a real-valued matrix, <span><math><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></math></span> is a fuzzy number vector, and <span><math><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow></math></span> is the unknown fuzzy number vector. The elements of both <span><math><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></math></span> and <span><math><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow></math></span> belong to <span><math><mi>X</mi></math></span>. We present the Cramer’s rule to calculate the solution with square matrix <em>A</em> and find out that its solution set is a <span><math><mrow><mn>5</mn><mo>(</mo><mi>n</mi><mo>−</mo><mi>R</mi><mo>(</mo><mi>A</mi><mo>)</mo><mo>)</mo></mrow></math></span> dimensional affine space with <span><math><mrow><mi>A</mi><mo>∈</mo><msup><mi>R</mi><mrow><mi>m</mi><mo>×</mo><mi>n</mi></mrow></msup></mrow></math></span> and <em>R</em>(<em>A</em>) being the rank of <em>A</em>. The explicit form of the solution for RREF matrix <em>A</em> is stated to ensure usability for modeling. Secondly, we solve the FFLS <span><math><mrow><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow><mrow><mover><mi>x</mi><mo>˜</mo></mover></mrow><mo>=</mo><mrow><mover><mi>b</mi><mo>˜</mo></mover></mrow></mrow></math></span>, where <span><math><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow></math></span> is a fuzzy matrix with all components in <span><math><mi>X</mi></math></span>. We analyze its solution set and present the parametric form of solutions under the fuzzy RREF matrix. We then adapt Gaussian elimination method to fuzzy matrices and systems by restricting it to the unit group of ring <span><math><mi>X</mi></math></span>, proving the equivalence of solution sets after elementary row operations. We also establish the connection between FFLS and SFLS by confining elements of <span><math><mrow><mover><mi>A</mi><mo>˜</mo></mover></mrow></math></span> to a subset of <span><math><mi>X</mi></math></span> that forms a field. In the third part, two numerical examples are given to illustrated our method. All results in this paper are explicit since the Gaussian-PDMF space <span><math><mi>X</mi></math></span>, to which the membership function of the fuzzy number belongs, possesses a complete algebraic structure. The proposed framework offers a feasible and systematical tool for solving the mathematical m","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109772"},"PeriodicalIF":2.7,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-14DOI: 10.1016/j.fss.2026.109773
Hao Qiu , Huamin Wang , Likui Wang , Shiping Wen
In practical industrial systems, we often encounter nonlinear uncertainties, parameter jumps, or time-delay phenomena that easily destroy the stability of the system. To stabilize these disturbances, we construct a more general closed-loop interval type-2 fuzzy delayed semi-Markov jump system (IT-2FD S-MJS) and investigate its stochastic stability in this article. Firstly, to optimize the performance of computational resources and data transmission, we introduce quantization techniques and novel adaptive dynamic data sampling-based event-triggered mechanisms, greatly reducing the number of triggers and improving the flexibility of adjustment. The framework’s discrete sampling nature inherently prevents Zeno behavior by eliminating the possibility of infinite triggers within finite time intervals. Then, by constructing boundary/general uncertain transition rates (BUTR/GUTR) and slack matrices, we derive sufficient conditions with less conservatism of stochastic stability for IT-2FD S-MJS. It should be noticed that the unknown transition information is modeled by BUTR/GUTR, and the conservatism of mismatched membership functions is reduced by introducing the slack matrices. Meanwhile, we obtain the corresponding gain parameters of the adaptive dynamic event-triggered quantization controller using linear matrix inequality (LMI) technology, with implementation details specified in Algorithms 1 and 2. Finally, we take the robotic arm and tunnel diode circuit as examples to verify the validity of the theorems.
{"title":"Adaptive dynamic event-triggered control for IT-2 fuzzy delayed semi-Markov jump systems with different uncertain transition rates","authors":"Hao Qiu , Huamin Wang , Likui Wang , Shiping Wen","doi":"10.1016/j.fss.2026.109773","DOIUrl":"10.1016/j.fss.2026.109773","url":null,"abstract":"<div><div>In practical industrial systems, we often encounter nonlinear uncertainties, parameter jumps, or time-delay phenomena that easily destroy the stability of the system. To stabilize these disturbances, we construct a more general closed-loop interval type-2 fuzzy delayed semi-Markov jump system (IT-2FD S-MJS) and investigate its stochastic stability in this article. Firstly, to optimize the performance of computational resources and data transmission, we introduce quantization techniques and novel adaptive dynamic data sampling-based event-triggered mechanisms, greatly reducing the number of triggers and improving the flexibility of adjustment. The framework’s discrete sampling nature inherently prevents Zeno behavior by eliminating the possibility of infinite triggers within finite time intervals. Then, by constructing boundary/general uncertain transition rates (BUTR/GUTR) and slack matrices, we derive sufficient conditions with less conservatism of stochastic stability for IT-2FD S-MJS. It should be noticed that the unknown transition information is modeled by BUTR/GUTR, and the conservatism of mismatched membership functions is reduced by introducing the slack matrices. Meanwhile, we obtain the corresponding gain parameters of the adaptive dynamic event-triggered quantization controller using linear matrix inequality (LMI) technology, with implementation details specified in Algorithms 1 and 2. Finally, we take the robotic arm and tunnel diode circuit as examples to verify the validity of the theorems.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109773"},"PeriodicalIF":2.7,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-07DOI: 10.1016/j.fss.2026.109761
Pavel Martinek
The paper provides a survey of several ways how to describe fuzzy multiset regular languages, i.e., languages generated by fuzzy multiset regular grammars. These languages can also be characterized by means of fuzzy multiset finite automata (both in general and in reduced forms), fuzzy multiset regular expressions, and as fuzzy multiset languages which can be expressed in a semilinear form. Moreover, it is pointed out that a prevailing number of already published papers concerning fuzzy multiset finite automata is based on a wrong definition. It is also shown that the name ‘deterministic fuzzy multiset finite automaton’ is often used incorrectly for automata deserving adjective pseudodeterministic.
{"title":"Fuzzy multiset regular languages and their basic characterizations","authors":"Pavel Martinek","doi":"10.1016/j.fss.2026.109761","DOIUrl":"10.1016/j.fss.2026.109761","url":null,"abstract":"<div><div>The paper provides a survey of several ways how to describe fuzzy multiset regular languages, i.e., languages generated by fuzzy multiset regular grammars. These languages can also be characterized by means of fuzzy multiset finite automata (both in general and in reduced forms), fuzzy multiset regular expressions, and as fuzzy multiset languages which can be expressed in a semilinear form. Moreover, it is pointed out that a prevailing number of already published papers concerning fuzzy multiset finite automata is based on a wrong definition. It is also shown that the name ‘deterministic fuzzy multiset finite automaton’ is often used incorrectly for automata deserving adjective pseudodeterministic.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109761"},"PeriodicalIF":2.7,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145981150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-12DOI: 10.1016/j.fss.2026.109767
Lili Shen, Jian Zhang
Let [0, 1]* be the unit interval [0,1] equipped with a continuous t-norm *. It is shown that the category of [0, 1]*-sets is cartesian closed if, and only if, * is the minimum t-norm on [0,1].
{"title":"Cartesian closedness of the category of real-valued sets, I","authors":"Lili Shen, Jian Zhang","doi":"10.1016/j.fss.2026.109767","DOIUrl":"10.1016/j.fss.2026.109767","url":null,"abstract":"<div><div>Let [0, 1]<sub>*</sub> be the unit interval [0,1] equipped with a continuous t-norm *. It is shown that the category of [0, 1]<sub>*</sub>-sets is cartesian closed if, and only if, * is the minimum t-norm on [0,1].</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109767"},"PeriodicalIF":2.7,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-12DOI: 10.1016/j.fss.2026.109770
Kejin Li, Feifei Du
The projective synchronization (PS) of discrete-time fractional-order fuzzy cellular neural networks (DFFCNNs) with distributed delays is investigated in this paper. First, based on the nabla fractional-order difference theory, a comparison principle suitable for fractional-order systems with variable coefficients and multiple time delays is established, and the sub-multiplicative law of the nabla Mittag-Leffler function is rigorously proved. Second, a discrete-time fractional-order Halanay inequality with arbitrary step size, variable coefficients, and multiple time-varying delays is introduced. Furthermore, leveraging the aforementioned inequality, a sufficient condition for the PS of DFFCNNs is derived. Finally, an example is presented to confirm the validity of the results.
{"title":"Exploring projective synchronization in discrete-time fractional-order fuzzy cellular neural networks with distributed delays","authors":"Kejin Li, Feifei Du","doi":"10.1016/j.fss.2026.109770","DOIUrl":"10.1016/j.fss.2026.109770","url":null,"abstract":"<div><div>The projective synchronization (PS) of discrete-time fractional-order fuzzy cellular neural networks (DFFCNNs) with distributed delays is investigated in this paper. First, based on the nabla fractional-order difference theory, a comparison principle suitable for fractional-order systems with variable coefficients and multiple time delays is established, and the sub-multiplicative law of the nabla Mittag-Leffler function is rigorously proved. Second, a discrete-time fractional-order Halanay inequality with arbitrary step size, variable coefficients, and multiple time-varying delays is introduced. Furthermore, leveraging the aforementioned inequality, a sufficient condition for the PS of DFFCNNs is derived. Finally, an example is presented to confirm the validity of the results.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109770"},"PeriodicalIF":2.7,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-13DOI: 10.1016/j.fss.2026.109768
Yang Liu , Zhen Wang , Xia Huang , Hao Shen
This paper put forward a type of general discontinuous activation functions (AFs) and then investigate the ψ-type multistability of fuzzy neural networks (FNNs). Through determining some algebraic inequalities, it is shown that FNNs with such discontinuous AFs can produce equilibrium points (EPs), in which EPs are locally ψ-stable and located at points of continuity (POC) of the AFs. Here, k refers to the number of discontinuous points of the AFs. Depending on the choice of the function ψ(t), the obtained EPs in FNNs can exhibit different types of stability. FNNs with the designed AFs are able to possess larger number of locally ψ-stable EPs and total EPs compared with general continuous AFs. Therefore, when applied in associative memory, FNNs with the above discontinuous AFs are able to store more memory patterns. Besides, attraction basins (ABs) associated with the ψ-stable EPs in FNNs are estimated. The correctness of the obtained results are verified through three examples.
{"title":"ψ-Type multistability of takagi-Sugeno fuzzy neural networks with general discontinuous activation functions","authors":"Yang Liu , Zhen Wang , Xia Huang , Hao Shen","doi":"10.1016/j.fss.2026.109768","DOIUrl":"10.1016/j.fss.2026.109768","url":null,"abstract":"<div><div>This paper put forward a type of general discontinuous activation functions (AFs) and then investigate the <em>ψ</em>-type multistability of fuzzy neural networks (FNNs). Through determining some algebraic inequalities, it is shown that FNNs with such discontinuous AFs can produce <span><math><msup><mrow><mo>(</mo><mn>2</mn><mi>k</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mi>n</mi></msup></math></span> equilibrium points (EPs), in which <span><math><msup><mrow><mo>(</mo><mi>k</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mi>n</mi></msup></math></span> EPs are locally <em>ψ</em>-stable and located at points of continuity (POC) of the AFs. Here, <em>k</em> refers to the number of discontinuous points of the AFs. Depending on the choice of the function <em>ψ</em>(<em>t</em>), the obtained <span><math><msup><mrow><mo>(</mo><mi>k</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mi>n</mi></msup></math></span> EPs in FNNs can exhibit different types of stability. FNNs with the designed AFs are able to possess larger number of locally <em>ψ</em>-stable EPs and total EPs compared with general continuous AFs. Therefore, when applied in associative memory, FNNs with the above discontinuous AFs are able to store more memory patterns. Besides, attraction basins (ABs) associated with the <em>ψ</em>-stable EPs in FNNs are estimated. The correctness of the obtained results are verified through three examples.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109768"},"PeriodicalIF":2.7,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145981152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-12DOI: 10.1016/j.fss.2026.109769
Siyu Xu, Xiaodong Pan, Yexing Dan, Keyun Qin
Recently, by using overlap and grouping functions, Han et al. introduced two novel types of fuzzy rough sets on complete lattices in an L-fuzzy approximation space (U, V, R), along with their application to three-way decisions. We refer to these two types of fuzzy rough sets as the 1st type and the 2nd type of fuzzy rough sets. It is worth noting that, in the case where (U, V, R) is an L-fuzzy approximation space, many properties of these two types of fuzzy rough sets established in L-fuzzy approximation spaces of the form (U, R) (i.e., ) are generally difficult to establish in this more general framework. Therefore, in this paper, we focus on exploring some properties of these two types of fuzzy rough sets under the restriction to an L-fuzzy approximation space (U, R), with particular emphasis on how they generate Alexandrov L-fuzzy topologies. In particular, regarding the 2nd type of fuzzy rough sets, we deduce the behaviours of the upper and lower L-fuzzy rough approximation operators of an L-fuzzy approximation space (U, R) in the case of a family of L-fuzzy relations. Moreover, we explore the relationships among the pair of upper and lower L-fuzzy rough approximation operators proposed by Jiang and Hu in 2022 and the two pairs of upper and lower L-fuzzy rough approximation operators introduced in this study. Our investigations can be regarded as a contribution to enriching the theoretical framework of the two novel types of fuzzy rough sets by Han et al. in an L-fuzzy approximation space (U, V, R).
{"title":"Some properties of two types of fuzzy rough sets on complete lattices constructed by means of overlap and grouping functions","authors":"Siyu Xu, Xiaodong Pan, Yexing Dan, Keyun Qin","doi":"10.1016/j.fss.2026.109769","DOIUrl":"10.1016/j.fss.2026.109769","url":null,"abstract":"<div><div>Recently, by using overlap and grouping functions, Han et al. introduced two novel types of fuzzy rough sets on complete lattices in an <em>L</em>-fuzzy approximation space (<em>U, V, R</em>), along with their application to three-way decisions. We refer to these two types of fuzzy rough sets as the 1<sup><em>st</em></sup> type and the 2<sup><em>nd</em></sup> type of fuzzy rough sets. It is worth noting that, in the case where (<em>U, V, R</em>) is an <em>L</em>-fuzzy approximation space, many properties of these two types of fuzzy rough sets established in <em>L</em>-fuzzy approximation spaces of the form (<em>U, R</em>) (i.e., <span><math><mrow><mi>U</mi><mo>=</mo><mi>V</mi></mrow></math></span>) are generally difficult to establish in this more general framework. Therefore, in this paper, we focus on exploring some properties of these two types of fuzzy rough sets under the restriction to an <em>L</em>-fuzzy approximation space (<em>U, R</em>), with particular emphasis on how they generate Alexandrov <em>L</em>-fuzzy topologies. In particular, regarding the 2<sup><em>nd</em></sup> type of fuzzy rough sets, we deduce the behaviours of the upper and lower <em>L</em>-fuzzy rough approximation operators of an <em>L</em>-fuzzy approximation space (<em>U, R</em>) in the case of a family of <em>L</em>-fuzzy relations. Moreover, we explore the relationships among the pair of upper and lower <em>L</em>-fuzzy rough approximation operators proposed by Jiang and Hu in 2022 and the two pairs of upper and lower <em>L</em>-fuzzy rough approximation operators introduced in this study. Our investigations can be regarded as a contribution to enriching the theoretical framework of the two novel types of fuzzy rough sets by Han et al. in an <em>L</em>-fuzzy approximation space (<em>U, V, R</em>).</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109769"},"PeriodicalIF":2.7,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145981153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-10DOI: 10.1016/j.fss.2026.109771
Roberto G. Aragón, Jesús Medina, Samuel Molina-Ruiz
In many situations is fundamental to use a procedure to aggregate information obtained from different sources (devices), such as when an edge computing system is used. Bonds were introduced in formal concept analysis as an aggregation method for linking different contexts (datasets) whilst preserving the information they contain. In this paper, we generalize the notion of bond to the multi-adjoint concept lattice framework, which is a fuzzy and flexible extension of formal concept analysis. Furthermore, we study several properties of multi-adjoint bonds defined by the constantly top or constantly bottom relations, with an emphasis on how they aggregate the information in the concept lattices.
{"title":"Context-based sum via multi-adjoint bonds","authors":"Roberto G. Aragón, Jesús Medina, Samuel Molina-Ruiz","doi":"10.1016/j.fss.2026.109771","DOIUrl":"10.1016/j.fss.2026.109771","url":null,"abstract":"<div><div>In many situations is fundamental to use a procedure to aggregate information obtained from different sources (devices), such as when an edge computing system is used. Bonds were introduced in formal concept analysis as an aggregation method for linking different contexts (datasets) whilst preserving the information they contain. In this paper, we generalize the notion of bond to the multi-adjoint concept lattice framework, which is a fuzzy and flexible extension of formal concept analysis. Furthermore, we study several properties of multi-adjoint bonds defined by the constantly top or constantly bottom relations, with an emphasis on how they aggregate the information in the concept lattices.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109771"},"PeriodicalIF":2.7,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145981154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-05-15Epub Date: 2026-01-16DOI: 10.1016/j.fss.2026.109777
Jieqiong Shi , Bin Zhao , Bernard De Baets
It is well known that the distributivity of one aggregation function over another is a desirable interaction between aggregation functions and has been continuously studied in the literature both for theoretical and practical reasons. Among the many classes of aggregation functions introduced over the past decades, the classes of uninorms and nullnorms stand out because of their potential applications in a broad variety of fields. Similarly, the classes of overlap and grouping functions have received ample attention. In this paper, on the one hand, we focus on the class of S-uninorms, a common generalization of nullnorms and conjunctive uninorms. On the other hand, we consider other more general classes of general overlap and general grouping functions. We continue and wrap up the investigation of the distributivity equation for the above-mentioned classes. In particular, we discuss the distributivity of S-uninorms (with an underlying uninorm belonging to ) over general overlap or general grouping functions, and vice versa. In both cases, we fully characterize the solutions by providing necessary and sufficient conditions.
{"title":"Distributivity between S-uninorms and general overlap or general grouping functions","authors":"Jieqiong Shi , Bin Zhao , Bernard De Baets","doi":"10.1016/j.fss.2026.109777","DOIUrl":"10.1016/j.fss.2026.109777","url":null,"abstract":"<div><div>It is well known that the distributivity of one aggregation function over another is a desirable interaction between aggregation functions and has been continuously studied in the literature both for theoretical and practical reasons. Among the many classes of aggregation functions introduced over the past decades, the classes of uninorms and nullnorms stand out because of their potential applications in a broad variety of fields. Similarly, the classes of overlap and grouping functions have received ample attention. In this paper, on the one hand, we focus on the class of S-uninorms, a common generalization of nullnorms and conjunctive uninorms. On the other hand, we consider other more general classes of general overlap and general grouping functions. We continue and wrap up the investigation of the distributivity equation for the above-mentioned classes. In particular, we discuss the distributivity of S-uninorms (with an underlying uninorm belonging to <span><math><msub><mi>U</mi><mi>min</mi></msub></math></span>) over general overlap or general grouping functions, and vice versa. In both cases, we fully characterize the solutions by providing necessary and sufficient conditions.</div></div>","PeriodicalId":55130,"journal":{"name":"Fuzzy Sets and Systems","volume":"531 ","pages":"Article 109777"},"PeriodicalIF":2.7,"publicationDate":"2026-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号