不确定性的处理:基于经典逻辑背景的粗糙集方法

Tamás Kádek, Tamás Mihálydeák
{"title":"不确定性的处理:基于经典逻辑背景的粗糙集方法","authors":"Tamás Kádek, Tamás Mihálydeák","doi":"10.33039/AMI.2021.02.005","DOIUrl":null,"url":null,"abstract":"The representative-based approximation has been widely studied in rough set theory. Hence, rough set approximations can be defined by the system of representatives, which plays a crucial role in set approximation. In the authors’ previous research a possible use of the similarity-based rough set in first-order logic was investigated. Now our focus has changed to representative-based approximation systems. In this article the authors show a logical system relying on representative-based set approximation. In our approach a three-valued partial logic system is introduced. Based on the properties of the approximation space, our theorems prove that in some cases, there exists an efficient way to evaluate the first-order formulae.","PeriodicalId":8040,"journal":{"name":"Applied Medical Informaticvs","volume":"28 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dealing with uncertainty: A rough-set-based approach with the background of classical logic\",\"authors\":\"Tamás Kádek, Tamás Mihálydeák\",\"doi\":\"10.33039/AMI.2021.02.005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The representative-based approximation has been widely studied in rough set theory. Hence, rough set approximations can be defined by the system of representatives, which plays a crucial role in set approximation. In the authors’ previous research a possible use of the similarity-based rough set in first-order logic was investigated. Now our focus has changed to representative-based approximation systems. In this article the authors show a logical system relying on representative-based set approximation. In our approach a three-valued partial logic system is introduced. Based on the properties of the approximation space, our theorems prove that in some cases, there exists an efficient way to evaluate the first-order formulae.\",\"PeriodicalId\":8040,\"journal\":{\"name\":\"Applied Medical Informaticvs\",\"volume\":\"28 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Medical Informaticvs\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.33039/AMI.2021.02.005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Medical Informaticvs","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33039/AMI.2021.02.005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基于代表性的近似在粗糙集理论中得到了广泛的研究。因此,粗糙集近似可以用代表系统来定义,代表系统在集合近似中起着至关重要的作用。在作者先前的研究中,研究了基于相似度的粗糙集在一阶逻辑中的可能应用。现在我们的重点转向了基于代表性的近似系统。在本文中,作者展示了一个依赖于基于代表的集合逼近的逻辑系统。在我们的方法中,引入了一个三值部分逻辑系统。根据近似空间的性质,我们的定理证明了在某些情况下,存在一种对一阶公式求值的有效方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dealing with uncertainty: A rough-set-based approach with the background of classical logic
The representative-based approximation has been widely studied in rough set theory. Hence, rough set approximations can be defined by the system of representatives, which plays a crucial role in set approximation. In the authors’ previous research a possible use of the similarity-based rough set in first-order logic was investigated. Now our focus has changed to representative-based approximation systems. In this article the authors show a logical system relying on representative-based set approximation. In our approach a three-valued partial logic system is introduced. Based on the properties of the approximation space, our theorems prove that in some cases, there exists an efficient way to evaluate the first-order formulae.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信