On the handling of inconsistent systems based on min-implication compositions

In this article, we study the inconsistency of systems of fuzzy relational equations based on min-implication compositions, where the implications are residual implicators associated with continuous t-norms. The study focuses on three min-implication compositions: min-Gödel, min-Goguen, and min-Łukasiewicz. To address the inconsistency of a min-implication system, we study how to construct consistent systems close to the inconsistent system by minimally perturbing the right-hand side vector of the inconsistent system. The solutions of the obtained consistent systems are considered as approximate solutions of the inconsistent system. Closeness is measured with the Chebyshev distance, i.e. the distance induced by the L-infinity norm, between the right-hand side vector of the considered inconsistent system and the set of right-hand side vectors of the consistent systems that are defined using the same matrix: the matrix of the inconsistent system. We give explicit analytical formulas for computing the Chebyshev distances for min-Gödel, min-Goguen, and min-Łukasiewicz systems.

Authors

Institutions

Publication Details

Journal
International Journal of General Systems
Published
2026-09-25
DOI
https://doi.org/10.1080/03081079.2026.2737671
Primary Topic
Advanced Algebra and Logic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

On the handling of inconsistent systems based on min-implication compositions

Ismaïl Baaj
International Journal of General Systems
Advanced Algebra and Logic
article

On the handling of inconsistent systems based on min-implication compositions

Ismaïl Baaj
article en

Abstract

In this article, we study the inconsistency of systems of fuzzy relational equations based on min-implication compositions, where the implications are residual implicators associated with continuous t-norms. The study focuses on three min-implication compositions: min-Gödel, min-Goguen, and min-Łukasiewicz. To address the inconsistency of a min-implication system, we study how to construct consistent systems close to the inconsistent system by minimally perturbing the right-hand side vector of the inconsistent system. The solutions of the obtained consistent systems are considered as approximate solutions of the inconsistent system. Closeness is measured with the Chebyshev distance, i.e. the distance induced by the L-infinity norm, between the right-hand side vector of the considered inconsistent system and the set of right-hand side vectors of the consistent systems that are defined using the same matrix: the matrix of the inconsistent system. We give explicit analytical formulas for computing the Chebyshev distances for min-Gödel, min-Goguen, and min-Łukasiewicz systems.

International Journal of General Systems
Université Paris-Panthéon-Assas (FR)
Openalex Percentile: Top 9%
Advanced Algebra and Logic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.