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 simplifi...

Full description

Saved in:
Bibliographic Details
Published inSoft computing (Berlin, Germany) Vol. 6; no. 6; pp. 428 - 435
Main Authors Chen, L., Wang, P. P.
Format Journal Article
LanguageEnglish
Published Heidelberg Springer Nature B.V 01.09.2002
Subjects
Online AccessGet full text
ISSN1432-7643
1433-7479
DOI10.1007/s00500-001-0157-3

Cover

Abstract 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=NP. Hence, the problem of solving fuzzy relation equations is an NP-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.
AbstractList 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=NP. Hence, the problem of solving fuzzy relation equations is an NP-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.
Author Chen, L.
Wang, P. P.
Author_xml – sequence: 1
  givenname: L.
  surname: Chen
  fullname: Chen, L.
– sequence: 2
  givenname: P. P.
  surname: Wang
  fullname: Wang, P. P.
BookMark eNp9kLFOwzAQhi1UJNrCA7BZYoHBcM4lvYQNVRQqVWKB2XISp3WVxq2dILVPT9oyMTDdP_zfne4bsUHjGsPYrYRHCUBPASABEABSgExI4AUbyhhRUEzZ4JQjQZMYr9gohDVAJCnBIVvMusNhz72pdWtdw82uO4XA7-cPz7xdGb40jfG65ropediawuraHkyfXf1tmyXX9dJ526424ZpdVroO5uZ3jtnX7PVz-i4WH2_z6ctCFFKmKLAsEQxAUaZljqh1TpPMyKSapDkhVZgTFaUu4wxTnWQQZ3kc6QqjgpIqR8Ixuzvv3Xq360xo1dp1vulPqiiTKRAiYN-ic6vwLgRvKlXY9vRc67WtlQR1VKfO6lSvTh3VqSMp_5Bbbzfa7_9hfgC-1nJn
CitedBy_id crossref_primary_10_1109_TFUZZ_2012_2232932
crossref_primary_10_1016_j_cam_2009_09_042
crossref_primary_10_1007_s40314_024_02945_7
crossref_primary_10_1016_j_fss_2019_04_029
crossref_primary_10_1016_j_fss_2023_108824
crossref_primary_10_1016_j_fss_2024_108944
crossref_primary_10_1016_j_ins_2011_02_018
crossref_primary_10_1109_TFUZZ_2009_2031561
crossref_primary_10_1016_j_ins_2007_07_022
crossref_primary_10_1109_TFUZZ_2021_3081251
crossref_primary_10_1155_2011_429498
crossref_primary_10_1016_j_camwa_2007_06_028
crossref_primary_10_1155_2019_8179763
crossref_primary_10_1007_s00500_018_3236_4
crossref_primary_10_1109_TFUZZ_2020_3028641
crossref_primary_10_3233_JIFS_191565
crossref_primary_10_1016_j_ins_2022_11_123
crossref_primary_10_3390_en12081580
crossref_primary_10_1016_j_fiae_2017_12_002
crossref_primary_10_1109_ACCESS_2019_2912217
crossref_primary_10_1109_TFUZZ_2017_2771406
crossref_primary_10_1007_s00500_018_3612_0
crossref_primary_10_1016_j_fss_2004_09_010
crossref_primary_10_1016_j_ins_2020_03_047
crossref_primary_10_3390_math10193452
crossref_primary_10_1016_j_asoc_2009_12_014
crossref_primary_10_1016_j_ins_2007_02_037
crossref_primary_10_1007_s10700_011_9100_y
crossref_primary_10_1142_S0218488515500348
crossref_primary_10_26599_FIE_2024_9270047
crossref_primary_10_1016_j_camwa_2011_01_023
crossref_primary_10_1007_s00500_022_07076_x
crossref_primary_10_1007_s00500_006_0050_1
crossref_primary_10_1080_16168658_2022_2161442
crossref_primary_10_1016_j_ins_2023_119696
crossref_primary_10_1016_j_mcm_2007_04_010
crossref_primary_10_1007_s10700_009_9059_0
crossref_primary_10_1016_j_asoc_2018_04_029
crossref_primary_10_1016_j_ins_2015_07_058
crossref_primary_10_31829_2637_9252_AIE_1_1__103
crossref_primary_10_1016_j_ins_2015_07_015
crossref_primary_10_31829_2637_9252_AIE_1_1__105
crossref_primary_10_1007_s13042_016_0527_x
crossref_primary_10_1007_s11424_009_9146_x
crossref_primary_10_1016_j_fss_2017_08_001
crossref_primary_10_1155_2019_4960638
crossref_primary_10_1016_j_fss_2012_04_009
crossref_primary_10_1109_ACCESS_2024_3467191
crossref_primary_10_1007_s40815_015_0083_7
crossref_primary_10_1007_s10700_021_09377_6
crossref_primary_10_1007_s00500_006_0103_5
crossref_primary_10_1109_ACCESS_2020_3034279
crossref_primary_10_1016_j_fss_2024_109011
crossref_primary_10_1016_j_ins_2011_03_004
crossref_primary_10_1109_ACCESS_2022_3197611
crossref_primary_10_1109_TFUZZ_2016_2593496
crossref_primary_10_1016_j_fss_2009_01_012
crossref_primary_10_1109_ACCESS_2018_2834231
crossref_primary_10_1080_10170660809509095
crossref_primary_10_1016_j_ins_2019_06_058
crossref_primary_10_1007_s10700_012_9129_6
crossref_primary_10_1016_j_ins_2021_04_065
crossref_primary_10_1007_s10559_009_9130_4
crossref_primary_10_1109_TFUZZ_2015_2394396
crossref_primary_10_1016_j_fss_2007_02_009
crossref_primary_10_3233_IFS_151546
crossref_primary_10_1155_2019_6901818
crossref_primary_10_1016_j_ins_2016_04_041
crossref_primary_10_1109_ACCESS_2021_3092745
crossref_primary_10_1016_j_fss_2008_02_020
crossref_primary_10_1007_s00500_023_09612_9
crossref_primary_10_1007_s10700_008_9029_y
crossref_primary_10_1016_j_cie_2007_11_011
crossref_primary_10_31829_2637_9252_aie2018_1_1__105
crossref_primary_10_1109_TFUZZ_2015_2428716
crossref_primary_10_1016_j_ins_2017_07_032
crossref_primary_10_1080_16168658_2022_2152906
crossref_primary_10_1142_S0218488508005029
crossref_primary_10_31829_2637_9252_aie2018_1_1__103
crossref_primary_10_1155_2013_760704
crossref_primary_10_1016_j_cie_2020_106537
crossref_primary_10_1016_j_mcm_2010_07_018
crossref_primary_10_1109_ACCESS_2018_2878748
crossref_primary_10_1016_j_eswa_2009_03_037
crossref_primary_10_1016_j_ins_2011_04_012
crossref_primary_10_1016_j_ins_2011_04_011
crossref_primary_10_1016_j_ins_2022_01_023
crossref_primary_10_1109_TFUZZ_2007_902018
crossref_primary_10_1142_S0218488519500247
crossref_primary_10_1016_j_cie_2014_03_024
crossref_primary_10_1016_j_fss_2008_02_017
crossref_primary_10_1016_j_fss_2017_04_002
ContentType Journal Article
Copyright Springer-Verlag Berlin Heidelberg 2002.
Copyright_xml – notice: Springer-Verlag Berlin Heidelberg 2002.
DBID AAYXX
CITATION
8FE
8FG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
DOI 10.1007/s00500-001-0157-3
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central
ProQuest Central Student
ProQuest SciTech Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
DatabaseTitle CrossRef
Advanced Technologies & Aerospace Collection
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
ProQuest One Academic Eastern Edition
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Advanced Technologies & Aerospace Collection
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1433-7479
EndPage 435
ExternalDocumentID 10_1007_s00500_001_0157_3
GroupedDBID -Y2
-~C
.86
.VR
06D
0R~
0VY
1N0
1SB
203
29~
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5VS
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
AAYZH
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDZT
ABECU
ABFSG
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACSTC
ACZOJ
ADHHG
ADHIR
ADHKG
ADKFA
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFGCZ
AFHIU
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHBYD
AHPBZ
AHWEU
AHYZX
AIAKS
AIGIU
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
B-.
BA0
BDATZ
BENPR
BGLVJ
BGNMA
BSONS
CCPQU
CITATION
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ7
GQ8
GXS
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
IWAJR
IXC
IXD
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K7-
KDC
KOV
LAS
LLZTM
M4Y
MA-
N2Q
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9J
OAM
P2P
P9P
PF0
PHGZM
PHGZT
PQGLB
PT4
PT5
PUEGO
QOS
R89
R9I
ROL
RPX
RSV
S16
S27
S3B
SAP
SDH
SEG
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
ZMTXR
8FE
8FG
AZQEC
DWQXO
GNUQQ
JQ2
P62
PKEHL
PQEST
PQQKQ
PQUKI
RIG
ID FETCH-LOGICAL-c1183-3dd30e00cd8db33aab769e15f68b737f3b77cdad4938a59049b42af32c75fb373
IEDL.DBID BENPR
ISSN 1432-7643
IngestDate Fri Jul 25 23:46:18 EDT 2025
Wed Oct 01 02:45:06 EDT 2025
Thu Apr 24 22:52:26 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1183-3dd30e00cd8db33aab769e15f68b737f3b77cdad4938a59049b42af32c75fb373
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2918073303
PQPubID 2043697
PageCount 8
ParticipantIDs proquest_journals_2918073303
crossref_citationtrail_10_1007_s00500_001_0157_3
crossref_primary_10_1007_s00500_001_0157_3
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2002-9-1
20020901
PublicationDateYYYYMMDD 2002-09-01
PublicationDate_xml – month: 09
  year: 2002
  text: 2002-9-1
  day: 01
PublicationDecade 2000
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationTitle Soft computing (Berlin, Germany)
PublicationYear 2002
Publisher Springer Nature B.V
Publisher_xml – name: Springer Nature B.V
SSID ssj0021753
Score 1.5890994
Snippet 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...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 428
SubjectTerms Algorithms
Fuzzy logic
Mathematical logic
Polynomials
Title Fuzzy relation equations (I): the general and specialized solving algorithms
URI https://www.proquest.com/docview/2918073303
Volume 6
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVLSH
  databaseName: SpringerLink Journals
  customDbUrl:
  mediaType: online
  eissn: 1433-7479
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: AFBBN
  dateStart: 19970401
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1433-7479
  dateEnd: 20061231
  omitProxy: true
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: BENPR
  dateStart: 19970401
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK - Czech Republic Consortium
  customDbUrl:
  eissn: 1433-7479
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: AGYKE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://link.springer.com
  providerName: Springer Nature
– providerCode: PRVAVX
  databaseName: SpringerLink Journals (ICM)
  customDbUrl:
  eissn: 1433-7479
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0021753
  issn: 1432-7643
  databaseCode: U2A
  dateStart: 19970404
  isFulltext: true
  titleUrlDefault: http://www.springerlink.com/journals/
  providerName: Springer Nature
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LSwMxEB60vXjxLdZHycGDCovpZrMPQcSKaxUpIhZ6W_LaKtS-e7C_3iSbrfTS20J2DzvJzHyTTL4P4EIHPB77CfdC7HMvCBvMi0NBPcGoJConJkeabot22OoEr13a3YB2eRfGtFWWMdEGajkUZo_8xk8asREYxOR-NPaMapQ5XS0lNJiTVpB3lmJsE6q-YcaqQLX51H7_WJZgjpdSgwSNK3UyLs85saUVpfaWtSmvqfa81Uy1Gqht9kl3YdvBRvRQzPMebKjBPuyUkgzIeegBvKXzxeIXTVyLG1Ljgsp7ii5frm6RRnuoVxBNIzaQaFqoz38vlH4e9s3mAmL9nv7v2dfP9BA66dPnY8tzggme0HUC8YiUBCuMhYwlJ4QxHoWJatA8jHlEopzwKBKSySAhMaOJLg544LOc-CKiOScROYLKYDhQx4CCUGGmsYDAnAVWFz1pMI2dAkrCmMm8Brg0TiYcm7gRtehnSx5ka0_TM5cZe2akBtfLT0YFlca6l89Ki2fOq6bZ_xo4WT98CltWtcX2gp1BZTaZq3MNHma8Dptx-lyH6kPabLbrbn38AQqIwgM
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LaxRBEC5ictCL8Yl5qH1QUGGwd6p7HkIIUbPsmnURSSC3Sb8mCpvdJLNBsj_O32Z1T89KLrnlNjCPQ0111VfdVd8H8IYCni7SUicZT3Uisp5KiszIxChp0dXoc6TvthhngyPx7Vger8DfbhbGt1V2MTEEajszfo_8Y1r2Ci8wyHH3_CLxqlH-dLWT0FBRWsHuBIqxONhx4K7_UAnX7Ay_0v9-m6b9_cMvgySqDCSGwDUmaC1yx7mxhdWISuk8K11P1lmhc8xr1HlurLKixELJkhC1FqmqMTW5rDXmSN-9B2sCRUnF39rn_fGPn8uSL_JgEighHEvJvztX5YHGVIapbl_OS1rpNzPjzcQQsl3_ETyMMJXttX71GFbc9AmsdxIQLEaEpzDqXy0W1-wyttQxd9FShzfs3fD9J0bokp22xNZMTS1rWrX73wtH17OJ38xganJKdp7_OmuewdGdmO45rE5nU_cCmMgcV4Q9DNdKBB32sqcIqwmJWaFsvQG8M05lInu5F9GYVEve5WBP36NXeXtWuAEflq-ct9Qdtz283Vm8iqu4qf773Obtt1_D_cHh91E1Go4PtuBBUIwJfWjbsDq_vHIvCbjM9avoHQxO7toh_wFkoPyf
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fuzzy+relation+equations+%28I%29%3A+the+general+and+specialized+solving+algorithms&rft.jtitle=Soft+computing+%28Berlin%2C+Germany%29&rft.au=Chen%2C+L.&rft.au=Wang%2C+P.+P.&rft.date=2002-09-01&rft.issn=1432-7643&rft.eissn=1433-7479&rft.volume=6&rft.issue=6&rft.spage=428&rft.epage=435&rft_id=info:doi/10.1007%2Fs00500-001-0157-3&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00500_001_0157_3
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-7643&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-7643&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-7643&client=summon