Inverted Fuzzy Implications in Approximate Reasoning

Z. Suraj, A. Lasek, Piotr Lasek
{"title":"Inverted Fuzzy Implications in Approximate Reasoning","authors":"Z. Suraj, A. Lasek, Piotr Lasek","doi":"10.3233/FI-2016-1309","DOIUrl":null,"url":null,"abstract":"In 1973 Lotfi Zadeh introduced the theory of fuzzy logic [17]. Fuzzy logic was an extension of Boolean logic so that it allowed using not only Boolean values to express reality. One kind of basic logical operations in fuzzy logic are so-called fuzzy implications. From over eight decades a number of different fuzzy implications have been described [3] [16]. In the family of all fuzzy implications the partial order induced from [0,1] interval exists. Pairs of incomparable fuzzy implications can generate new fuzzy implications by using min(inf) and max(sup) operations. As a result the structure of lattice is created ([1], page 186). This leads to the following question: how to choose the correct functions among basic fuzzy implications and other generated as described above. In our paper, we propose a new method for choosing implications. Our method allows to compare two fuzzy implications. If the truth value of the antecedent and the truth value of the implication are given, by means of inverse fuzzy implications we can easily optimize the truth value of the implication consequent. In other words, we can choose the fuzzy implication, which has the greatest or the smallest truth value of the implication consequent or which has greater or smaller truth value than another implication. Primary results regarding this problem are included in the paper [14].","PeriodicalId":286395,"journal":{"name":"International Workshop on Concurrency, Specification and Programming","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Concurrency, Specification and Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/FI-2016-1309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In 1973 Lotfi Zadeh introduced the theory of fuzzy logic [17]. Fuzzy logic was an extension of Boolean logic so that it allowed using not only Boolean values to express reality. One kind of basic logical operations in fuzzy logic are so-called fuzzy implications. From over eight decades a number of different fuzzy implications have been described [3] [16]. In the family of all fuzzy implications the partial order induced from [0,1] interval exists. Pairs of incomparable fuzzy implications can generate new fuzzy implications by using min(inf) and max(sup) operations. As a result the structure of lattice is created ([1], page 186). This leads to the following question: how to choose the correct functions among basic fuzzy implications and other generated as described above. In our paper, we propose a new method for choosing implications. Our method allows to compare two fuzzy implications. If the truth value of the antecedent and the truth value of the implication are given, by means of inverse fuzzy implications we can easily optimize the truth value of the implication consequent. In other words, we can choose the fuzzy implication, which has the greatest or the smallest truth value of the implication consequent or which has greater or smaller truth value than another implication. Primary results regarding this problem are included in the paper [14].
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
近似推理中的倒模糊含义
1973年Lotfi Zadeh引入了模糊逻辑理论[17]。模糊逻辑是布尔逻辑的扩展,因此它不仅允许使用布尔值来表达现实。模糊逻辑中的一种基本逻辑运算是所谓的模糊蕴涵。80多年来,许多不同的模糊含义被描述[3][16]。在所有模糊蕴涵族中,存在由区间[0,1]推导出的偏序。对不可比较的模糊含义可以通过min(inf)和max(sup)运算生成新的模糊含义。由此产生了晶格结构([1],186页)。这就导致了以下问题:如何在基本模糊含义和上述产生的其他含义中选择正确的函数。在本文中,我们提出了一种新的选择含义的方法。我们的方法允许比较两种模糊含义。如果先验的真值和蕴涵的真值是已知的,那么利用逆模糊蕴涵可以很容易地优化蕴涵后结果的真值。换句话说,我们可以选择模糊蕴涵,哪个蕴涵结果的真值最大或最小,哪个蕴涵的真值比另一个蕴涵大或小。关于这一问题的初步结果已在论文[14]中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Comparison of Heuristics for Optimization of Association Rules Dialogue in Hierarchical Learning of a Concept Using Prototypes and Counterexamples A Function Elimination Method for Checking Satisfiability of Arithmetical Logics Efficient Rough Set Theory Merging Query Rewriting Based on Meta-Granular Aggregation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1