Satisfiability in intuitionistic fuzzy logic with realistic tautology

Kuwait Journal of Science

Muhammad Ali Rushdi¹  Mohamed Zarouan²  Waleed Ahmad³  Ali Muhammad Rushdi⁴ 

[1] Department of Biomedical and Systems Engineering, Faculty of Engineering,Cairo University, Giza 12613, Arab Republic of Egypt{[e-mail]};Department of Electrical and Computer Engineering, Faculty of Engineering,King Abdulaziz University, P. O. Box 80204, Jeddah, 21589, Kingdom of Saudi Arabia;Department of Electrical and Computer Engineering, Faculty of Engineering,King Abdulaziz University, P. O. Box 80204, Jeddah, 21589, Kingdom of Saudi Arabia{ [e-mail]};ProfessorDepartment ofElectrical Engineering and Computer EngineeringFaculty of EngineeringKing Abdulaziz UniversityPhone: 6402000 Ext. 68013Email: arushdi @ kau.edu.sa

关键词: Intuitionistic fuzzy logic;    Realistic fuzzy tautology;    Boolean satisfiability;    CNF expression;    Disjoint DNF expression.;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: Kuwait University * Academic Publication Council

【 摘 要 】

Any variable in Intuitionistic Fuzzy Logic (IFL) is either a Realistic Fuzzy Tautology (RFT) with a Truth exceeding one half, or a non-Realistic Fuzzy Tautology (nRFT) with a Truth less than or equal to one half. This results in a dichotomy somewhat similar to that of the Excluded Middle in Ordinary Logic (OL) albeit allowing both Falsity and Hesitancy in addition to Truth in an IFL variable. Consequently, many problems (and solutions) in Boolean logic can be fuzzified without any significant change in their essence. We show herein that one such problem is that of Boolean satisfiability. We handle this problem by converting a CNF expression into a disjoint DNF one, and solving the resulting two-valued Boolean equation. This solution strategy is essentially retained in IFL, thanks to the RFT concept. All steps needed in the fuzzification process are proved, and a demonstrative example illustrates the method in both crisp and intuitionistic fuzzy cases.

【 授权许可】

Unknown