Maximal Consistent Subsystems of Max-T Fuzzy Relational Equations
Abstract
In this article, we study the inconsistency of a system of -T fuzzy relational equations of the form A T x = b, where T is a t-norm among , the product or Lukasiewicz's t-norm. For an inconsistent -T system, we directly construct a canonical maximal consistent subsystem (w.r.t the inclusion order). The main tool used to obtain it is the analytical formula which compute the Chebyshev distance = ∈fc ∈ C b - c associated to the inconsistent -T system, where C is the set of second members of consistent systems defined with the same matrix A. Based on the same analytical formula, we give, for an inconsistent - system, an efficient method to obtain all its consistent subsystems, and we show how to iteratively get all its maximal consistent subsystems.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.