Reasoning with belief functions over Belnap–Dunn logic

arxiv(2023)

引用 1|浏览0
暂无评分
摘要
We design an expansion of Belnap–Dunn logic with belief and plausibility functions that allows non-trivial reasoning with contradictory and incomplete probabilistic information. We also formalise reasoning with non-standard probabilities and belief functions in two ways. First, using a calculus of linear inequalities, akin to the one presented in [23]. Second, as a two-layered modal logic wherein reasoning with evidence (the outer layer) utilises paraconsistent expansions of Łukasiewicz logic. The second approach is inspired by [3]. We prove completeness for both kinds of calculi and show their equivalence by establishing faithful translations in both directions.
更多
查看译文
关键词
03B42,03B48,03B52,03B53
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要