A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The Complexity of Non-Iterated Probabilistic Justification Logic
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
Other Versions
The logic PJ is a probabilistic logic defined by adding (non-iterated) probability operators to the basic justification logic J. In this paper we establish upper and lower bounds for the complexity of the derivability problem in the logic PJ. The main result of the paper is that the complex- ity of the derivability problem in PJ remains the same as the complexity of the derivability problem in the underlying logic J, which is Πp2-complete. This implies hat the probability operators do not
doi:10.1007/978-3-319-30024-5_16
fatcat:27toicnyrvfyvcprddonc5nxim