The general -decomposition problem of fuzzy relations

DOI10.1016/J.INS.2007.06.019MaRDI QIDQ2456464zbMATH OpenOpenAlexFDO

Authors Yan Yang, Xueping Wang

Publication date 18 October 2007

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2007.06.019

zbMATH Keywords

algorithmchromatic numberdecompositionfuzzy relationgeneral contentNP-complete

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Review text

The problem of decomposition of a fuzzy relation was posed by A. Di Nola, S. Sessa and W. Pedrycz in 1985 and generalized by \textit{J. Vrba} [Fuzzy Sets Syst. 54, No. 1, 69--79 (1993; Zbl 0793.04008)] and other authors. For example, \textit{Y. Yang} and \textit{X.-P. Wang} [Fuzzy Sets Syst. 151, No. 2, 403--419 (2005; Zbl 1062.03054)] discussed the problem of \(\alpha\)-decomposition of a fuzzy relation. They found two necessary and sufficient conditions for a fuzzy relation to be \(\alpha\)-decomposable. In this paper the authors extend the above-mentioned concept of \(\alpha\)-decomposition and they consider the general \(\alpha\)-decomposition of a fuzzy relation. They point out that every fuzzy relation is always generally \(\alpha\)-decomposable. Firstly, the authors recall some results of \(\alpha\)-decomposable fuzzy relations and they also give another necessary and sufficient condition for a fuzzy relation to be \(\alpha\)-decomposable. Next, the relationship between the \(\alpha\)-decomposition problem and the general \(\alpha\)-decomposition problem of fuzzy relations is investigated. Furthermore, some properties of generally \(\alpha\)-decomposable fuzzy relations are given and then an algorithm to construct a general \(\alpha\)-decomposition of a given fuzzy relation is presented. Moreover, the authors prove that the general content of a given fuzzy relation \(R\) is equal to the chromatic number of a simple graph generated by \(R\), where \(R\) is defined on finite sets. It is shown that calculating the general content of a given fuzzy relation is an NP-complete problem. Finally, an application of the general \(\alpha\)-decomposition problem of fuzzy relations in expert systems is given.

Recommendations

• Fuzzy relation \({\alpha_R}\) decomposition
• General decomposition of fuzzy relations: semi-tensor product approach
• On the convergence exponent of decomposable relations
• Optimization schemes for decomposition of fuzzy relations
• The study of joins in fuzzy relational databases
• To what extent does `decomposable' mean `transitive' for a fuzzy relation?
• scientific article; zbMATH DE number 3924778
• Decomposition problem of fuzzy relations-further results
• On the decomposition problem of fuzzy sets
• scientific article; zbMATH DE number 7028380

Cites work

• A Column Generation Approach for Graph Coloring
• A lower bound on the chromatic number of Mycielski graphs
• AI 2005: Advances in Artificial Intelligence
• Chromatic Scheduling and the Chromatic Number Problem
• Decomposition and resolution of min-implication fuzzy relation equations based on S-implications
• Finding the chromatic number by means of critical graphs
• FUZZY LOGICS AND THE GENERALIZED MODUS PONENS REVISITED
• Genetic and hybrid algorithms for graph coloring
• scientific article; zbMATH DE number 45267 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 4187836 (Why is no real title available?)
• Hybrid evolutionary algorithms for graph coloring
• New methods to color the vertices of a graph
• On the convergence exponent of decomposable relations
• Optimization schemes for decomposition of fuzzy relations
• Processing in relational structures: Fuzzy relational equations
• Resolution of composite fuzzy relation equations
• Solutions of composite fuzzy relational equations with triangular norms
• The solution sets of \@-fuzzy relational equations in finite domains and on a complete Brouwerian lattice
• Toward a generalized theory of uncertainty (GTU) -- an outline
• Two iterative methods of decomposition of a fuzzy relation for image compression/decompression processing

Cited in

(10)

• General decomposition problem of fuzzy relations
• Decomposition of realizable fuzzy relations
• A logic-based approach to incremental reasoning on multi-agent systems
• scientific article; zbMATH DE number 6522559 (Why is no real title available?)
• The -decomposition problem of a fuzzy relation R
• A NOTE ON “DECOMPOSITION PROBLEM OF FUZZY RELATIONS”
• Fuzzy relation \({\alpha_R}\) decomposition
• scientific article; zbMATH DE number 7028380 (Why is no real title available?)
• A survey on fuzzy relational equations. I: Classification and solvability
• The structure of decomposable indistinguishability operators

This page was built for publication: The general \(\alpha \)-decomposition problem of fuzzy relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456464)