Abstract
The problem of aggregating large fuzzy relational structures is of major importance. One of the main issues is seeking a simpler fuzzy relational structure, while keeping the structure properties of the original fuzzy relational structure as much as possible. This paper covers the mathematical foundations of the described problem, and deals with the solvability issues of two-mode weakly linear systems over complete residuated lattices. Within these systems, our objective is to identify a pair of unknown fuzzy relations that are present on both sides of the equation or inequality. We provide a characterization of the set of all pairs of fuzzy relations that are solutions to two-mode weakly linear systems to a desired degree, and develop an algorithm to compute the greatest such pair. We also present an algorithm to determine a pair that solves a two-mode weakly linear system to a given extent, such that each component is a fuzzy preorder (resp. fuzzy equivalence). Ultimately, we demonstrate the application aspects of aggregating fuzzy relational structures.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
