Fuzzy relation equations (I): the general and specialized solving algorithms

 In this article, we develop a new method and an algorithm to solve a system of fuzzy relation equations. We first introduce a solution-base-matrix and then give a tractable mathematical logic representation of all minimal solutions. Next, we design a new universal algorithm to get them. Two simplification rules are found to simplify the solution-base-matrix. We show that a polynomial time algorithm to find all minimal solutions for a general system of fuzzy relation equations simply does not exist with expectation of P=N P. Hence, the problem of solving fuzzy relation equations is an N P-hard problem in terms of computational complexity. Our universal algorithm is still useful when one does not solve a large number of equations. In many real applications the problem of solving fuzzy relation equations can be simplified in polynomial time problems. In this article, we will discuss several cases of practical applications which have such polynomial algorithms.

Authors and Affiliations

1. Department of Computing and Information Systems, University of Luton, Luton, LU1 3JU, UK, and Scientific & Practical Computing, P.O. Box 17, Centerville, UT 84014, USA e-mail: moorechen@yahoo.com, , , , , , US

   L. Chen

2. Department of Electrical and Computer Engineering, Duke University, Durham, NC 27708, USA, , , , , , US

   P. P. Wang

Reprints and permissions