The Complexity of Probabilistic Justification Logic
Logic in Computer Science
2017-08-15 v1
Abstract
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.
Cite
@article{arxiv.1708.04100,
title = {The Complexity of Probabilistic Justification Logic},
author = {Ioannis Kokkinis},
journal= {arXiv preprint arXiv:1708.04100},
year = {2017}
}
Comments
presented to the 11th Panhellenic Logic Symposium (http://pls11.cs.ntua.gr/)