Abstract
This study considers the problem of generating all minimal solutions of a system of fuzzy relational equations (FREs) with max-Archimedean t-norm composition. It defines the binding matrix of a system of FREs, and then shows that an irredundant covering of the binding matrix corresponds to a minimal solution of the FREs. Consequently, the problem of finding all minimal solutions of the FREs can be transformed into the problem of finding all irredundant coverings of the binding matrix. We propose an algorithm to solve the transformed problem. This algorithm builds all irredundant coverings in a bottom-up manner, i.e., all irredundant coverings of the binding matrix is built from the irredundant coverings of the submatrices of the binding matrix. Once all irredundant coverings have been found, they can be easily converted into the minimal solutions of original FREs.
Sign-in/Register to access full text options 
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.
