The solution sets of infinite fuzzy relational equations with sup-conjunctor composition on complete distributive lattices

Authors:
Xue-ping Wang;Chang Xia
Affiliations:
Department of Mathematics, Sichuan Normal University, Chengdu, Sichuan 610066, People's Republic of China;Department of Mathematics, Yang-En University, Quanzhou, Fujian 362014, People's Republic of China
Venue:
Fuzzy Sets and Systems
Year:
2009

Citing 7
Cited 4

On matrix equations in a class of complete and completely distributive lattices

Fuzzy Sets and Systems
Triangular norms on product lattices

Fuzzy Sets and Systems - Special issue on triangular norms
Method of solution to fuzzy equations in a complete Brouwerian lattice

Fuzzy Sets and Systems
Fuzzy Relation Equations and Their Applications to Knowledge Engineering

Fuzzy Relation Equations and Their Applications to Knowledge Engineering
Some properties of infinite fuzzy relational equations on complete Brouwerian lattices

Fuzzy Sets and Systems
On finite relation equations with sup-conjunctor composition over a complete lattice

Fuzzy Sets and Systems
The solution set of a fuzzy relational equation with sup-conjunctor composition in a complete lattice

Fuzzy Sets and Systems

On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations

Fuzzy Sets and Systems
Fuzzy relational equations on complete Brouwerian lattices

Information Sciences: an International Journal
Conditions for the existence of the least solution and minimal solutions to fuzzy relation equations over complete Brouwerian lattices

Information Sciences: an International Journal
Some properties of infinite fuzzy relational equations with sup-inf composition

Information Sciences: an International Journal

Quantified Score

Hi-index	0.20

Visualization

Abstract

This paper deals with sup-conjunctor composition fuzzy relational equations in infinite domains and on complete distributive lattices. When its right-hand side is a continuous join-irreducible element or has an irredundant continuous join-decomposition, a necessary and sufficient condition describing an attainable solution (resp. an unattainable solution) is formulated and some properties of the attainable solution (resp. the unattainable solution) are shown. Further, the structure of solution sets is investigated.