{"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.