Probabilistic Justification Logic

Probabilistic Justification Logic
复制标题

概率论证逻辑

DOI:
--
复制
发表时间:
2020
期刊:
Symposium on Logical Foundations of Computer Science
影响因子:
--
通讯作者:
T. Studer
T. Studer
中科院分区:
--
文献类型:
--
作者:
Ioannis Kokkinis;Z. Ognjanovic;T. Studer

文献摘要

被引文献

相似文献

我们提出了一个概率论证逻辑$mathsf{PPJ}$,作为关于理性信念、信念程度和论证的不确定推理框架。我们建立了一类可测类kripke模型$mathsf{PPJ}$的完备性和强完备性,并证明了可满足性问题是可决定的。我们将讨论$mathsf{PPJ}$如何为众所周知的彩票悖论提供见解。
We present a probabilistic justification logic, $mathsf{PPJ}$, as a framework for uncertain reasoning about rational belief, degrees of belief and justifications. We establish soundness and strong completeness for $mathsf{PPJ}$ with respect to the class of so-called measurable Kripke-like models and show that the satisfiability problem is decidable. We discuss how $mathsf{PPJ}$ provides insight into the well-known lottery paradox.