Handling the inconsistency of systems of $\min\rightarrow$ fuzzy relational equations
Isma\"il Baaj

TL;DR
This paper analyzes the inconsistency of systems of min-implication fuzzy relational equations, providing formulas for Chebyshev distances to measure inconsistency and exploring their properties across different residual implicators.
Contribution
It introduces analytical formulas for Chebyshev distances in fuzzy relational systems and characterizes their bounds and attainability for various residual implicators.
Findings
Chebyshev distance is the lower bound of solutions for these systems.
For Godel implication, the Chebyshev distance may be an infimum.
For Goguen and Lukasiewicz implications, the Chebyshev distance is always a minimum.
Abstract
In this article, we study the inconsistency of systems of fuzzy relational equations. We give analytical formulas for computing the Chebyshev distances associated to systems of fuzzy relational equations of the form , where is a residual implicator among the G\"odel implication , the Goguen implication or Lukasiewicz's implication and 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFuzzy Logic and Control Systems · Rough Sets and Fuzzy Logic
