A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The Complexity of Probabilistic Justification Logic
[article]
2017
arXiv
pre-print
Preserved Fulltext
Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in polynomial space. We show that this upper complexity bound is tight.
arXiv:1708.04100v1
fatcat:qyvmy4h2nffine5q35wafobxai