Semantics of Dempster-Shafer Inspired Si-Logic

D. Iourinski, R. Belavkin
{"title":"Semantics of Dempster-Shafer Inspired Si-Logic","authors":"D. Iourinski, R. Belavkin","doi":"10.1109/SOFA.2007.4318320","DOIUrl":null,"url":null,"abstract":"A new interpretation of Dempster-Shafer theory using Kripke models was recently proposed. The map between frames of discernment and Kripke models preserves Dempster-Shafer evidence combination rule and thus allows to use Kripke models for calculating beliefs in different propositions. The procedure induces a logic (as a set of true formulas). In the present paper we analyze the semantic of this logic. By representing the logic of interest through commutative lattices we show that it is a complete and sound logic, which does not have a finite independent axiomatization. The results can be used for choosing a propositional language for such logic and thus contribute towards building a fuzzy logic for Dempster-Shafer theory.","PeriodicalId":205589,"journal":{"name":"2007 2nd International Workshop on Soft Computing Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd International Workshop on Soft Computing Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOFA.2007.4318320","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A new interpretation of Dempster-Shafer theory using Kripke models was recently proposed. The map between frames of discernment and Kripke models preserves Dempster-Shafer evidence combination rule and thus allows to use Kripke models for calculating beliefs in different propositions. The procedure induces a logic (as a set of true formulas). In the present paper we analyze the semantic of this logic. By representing the logic of interest through commutative lattices we show that it is a complete and sound logic, which does not have a finite independent axiomatization. The results can be used for choosing a propositional language for such logic and thus contribute towards building a fuzzy logic for Dempster-Shafer theory.
Dempster-Shafer启发Si-Logic的语义
最近提出了一种利用Kripke模型对Dempster-Shafer理论的新解释。识别框架和Kripke模型之间的映射保留了Dempster-Shafer证据组合规则,从而允许使用Kripke模型计算不同命题中的信念。这个过程引出一个逻辑(作为一组真公式)。本文对该逻辑的语义进行了分析。通过交换格来表示感兴趣的逻辑,我们证明了它是一个完备的、健全的逻辑,它不具有有限的独立公理化。研究结果可用于为这种逻辑选择命题语言,从而有助于建立Dempster-Shafer理论的模糊逻辑。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信