Abstract
We present a probabilistic justification logic, PPJ, to study rational belief, degrees of belief and justifications.We establish soundness and completeness for PPJ and show that its satisfiability problem is decidable. In the last part we use PPJ to provide a solution to the lottery paradox.
Author supplied keywords
Cite
CITATION STYLE
APA
Kokkinis, I., Ognjanović, Z., & Studer, T. (2016). Probabilistic justification logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9537, pp. 174–186). Springer Verlag. https://doi.org/10.1007/978-3-319-27683-0_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free