Reasoning about knowledge and conditional probability

International Journal of Approximate Reasoning(2023)

引用 0|浏览3
暂无评分
摘要
We present a proof-theoretical and model-theoretical approach to reasoning about knowledge and conditional probability. We extend both the language of epistemic logic and the language of linear weight formulas, allowing statements like “Agent Ag knows that the probability of A given B is at least a half”. We present both a propositional and a first-order version of the logic. We provide sound and complete axiomatizations for both logics and we prove decidability in the propositional case.
更多
查看译文
关键词
Probabilistic logic,Epistemic logic,Completeness theorem,Decidability
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要