Abstract
The problem of solving a system of fuzzy relational equations with max-Archimedean t-norm composition is studied. It is shown that this problem is closely related to the covering problem, which belongs to the class of NP-hard problems. It is proved that there is a one-to-one correspondence between the minimal solutions of the equations and the irredundant coverings, as previously discovered by Markovskii [On the relation between equations with max-product composition and the covering problem, Fuzzy Sets and Systems, 153 (2005) 261–273] for fuzzy relational equations with max-product composition. Since max-product composition is a special case of max-Archimedean t-norm composition, this work extends Markovskii's work to fuzzy relational equations with max-Archimedean t-norm composition. An extension of Markovskii's algorithm is implemented, yielding a processing time linearly proportional to the square of the number of minimal solutions.
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.
