Probabilistic Justification Logic
| Contribuinte(s) |
Artemov, Sergei Nerode, Anil |
|---|---|
| Data(s) |
2015
|
| Resumo |
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. |
| Formato |
application/pdf |
| Identificador |
http://boris.unibe.ch/79976/1/kos16.pdf Kokkinis, Ioannis; Ognjanović, Zoran; Studer, Thomas (2015). Probabilistic Justification Logic. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings. Lecture Notes in Computer Science: Vol. 9537 (pp. 174-186). Cham: Springer 10.1007/978-3-319-27683-0_13 <http://dx.doi.org/10.1007/978-3-319-27683-0_13> doi:10.7892/boris.79976 info:doi:10.1007/978-3-319-27683-0_13 urn:issn:0302-9743 urn:isbn:978-3-319-27682-3 |
| Idioma(s) |
eng |
| Publicador |
Springer |
| Relação |
http://boris.unibe.ch/79976/ |
| Direitos |
info:eu-repo/semantics/restrictedAccess |
| Fonte |
Kokkinis, Ioannis; Ognjanović, Zoran; Studer, Thomas (2015). Probabilistic Justification Logic. In: Artemov, Sergei; Nerode, Anil (eds.) Logical Foundations of Computer Science - International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings. Lecture Notes in Computer Science: Vol. 9537 (pp. 174-186). Cham: Springer 10.1007/978-3-319-27683-0_13 <http://dx.doi.org/10.1007/978-3-319-27683-0_13> |
| Palavras-Chave | #000 Computer science, knowledge & systems #510 Mathematics |
| Tipo |
info:eu-repo/semantics/bookPart info:eu-repo/semantics/publishedVersion PeerReviewed |
