On finite relation equations with sup-conjunctor composition over a complete lattice

Authors:
Kun-Lun Zhang;Dong-Hai Li;Li-Xia Song
Affiliations:
North China Institute of Science and Technology, Beijing, PR China and Key Laboratory for Thermal Science and Power Engineering of Ministry of Education, Department of Thermal Engineering, Tsinghu ...;North China Institute of Science and Technology, Beijing, PR China and Key Laboratory for Thermal Science and Power Engineering of Ministry of Education, Department of Thermal Engineering, Tsinghu ...;North China Institute of Science and Technology, Beijing, PR China and Key Laboratory for Thermal Science and Power Engineering of Ministry of Education, Department of Thermal Engineering, Tsinghu ...
Venue:
Fuzzy Sets and Systems
Year:
2009

Citing 8
Cited 2

On direct and inverse problems for fuzzy equation systems with tolerances

Fuzzy Sets and Systems
On solving relational equations in Brouwerian lattices

Fuzzy Sets and Systems
The inverse problem for distributive lattices

Fuzzy Sets and Systems
Fuzzy sets and fuzzy logic: theory and applications

Fuzzy sets and fuzzy logic: theory and applications
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
Pseudo-t-norms and implication operators on a complete Brouwerian lattice

Fuzzy Sets and Systems - Possibility theory and fuzzy logic
Fuzzy relation equations for coding/decoding processes of images and videos

Information Sciences—Informatics and Computer Science: An International Journal

A survey on fuzzy relational equations, part I: classification and solvability

Fuzzy Optimization and Decision Making
The solution sets of infinite fuzzy relational equations with sup-conjunctor composition on complete distributive lattices

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.20

Visualization

Abstract

This work studies the problem of solving a sup-T composite finite relation equation over a complete lattice L, where T is a conjunctor. A criterion for the equation to have a solution is given. An algorithm for finding the solution set of the equation is presented.