| Authors: | Stepanović, Vanja Tepavčević, Andreja |
Affiliations: | Computer Science Mathematical Institute of the Serbian Academy of Sciences and Arts |
Title: | Systems of fuzzy relational equations in the general lattice-valued case | Journal: | International Journal of Approximate Reasoning | Volume: | 195 | First page: | 109703 | Issue Date: | 2026 | Rank: | M22 | ISSN: | 0888-613X | DOI: | 10.1016/j.ijar.2026.109703 | Abstract: | The paper provides an in-depth analysis of the fuzzy relational equations where fuzzy relations are defined as arbitrary mappings from the square of a domain set to a complete lattice, which is the most general lattice-valued case. In the investigations up to now, the codomain lattice was usually a special lattice, such as residual, Heyting, Browerian, continuous, etc. Using Tarski’s fixed point theorem for an operator on a complete lattice, we prove the existence of a solution for a wide class of fuzzy relational equations and their systems. Tarski’s theorem also implies the existence of the greatest and the least solution for the mentioned class of equations and their systems, and the fact that their solution sets are complete lattices. Starting from some construction versions of Tarski’s fixed point theorem, we also provide algorithms for the construction of the greatest and the least solution. |
Keywords: | Complete lattice | Extremal solutions | Fuzzy relational equations | Solvability | Publisher: | Elsevier | Project: | This research was supported by the Science Fund of the Republic of Serbia, # Grant no 6565, Advanced Techniques of Mathematical Aggregation and Approximative Equations Solving in Digital Operational Research-AT-MATADOR. The authors also gratefully acknowledge the financial support of the Ministry of Science, Technological Development and Innovation of the Republic of Serbia (Grants No. 451-03-137/2025-03/200116, 451-03-137/2025-03/200125 451-03-136/2025-03/200125 451-03-136/2025-03/200029). |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.