Handling the inconsistency of systems of → fuzzy relational equations

Abstract

In this article, we study the inconsistency of systems of -→ fuzzy relational equations. We give analytical formulas for computing the Chebyshev distances ∇ = ∈fd ∈ D β - d associated to systems of -→ fuzzy relational equations of the form → x = β, where → is a residual implicator among the G\"odel implication →G, the Goguen implication →GG or Lukasiewicz's implication →L and D is the set of second members of consistent systems defined with the same matrix . The main preliminary result that allows us to obtain these formulas is that the Chebyshev distance ∇ is the lower bound of the solutions of a vector inequality, whatever the residual implicator used. Finally, we show that, in the case of the -→G system, the Chebyshev distance ∇ may be an infimum, while it is always a minimum for -→GG and -→L systems.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…