Results 1 
2 of
2
On the Complexity of Twoagent Justification Logic
, 2014
"... We investigate the complexity of derivability for twoagent Justification Logic. For this purpose we revisit Yavorskaya’s twoagent LP with interactions (2008), we simplify the syntax and provide natural extensions. We consider twoagent versions of other justification logics as well as ways to comb ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We investigate the complexity of derivability for twoagent Justification Logic. For this purpose we revisit Yavorskaya’s twoagent LP with interactions (2008), we simplify the syntax and provide natural extensions. We consider twoagent versions of other justification logics as well as ways to combine two justification logics. For most of these cases we prove that the upper complexity bound established for the singleagent cases are maintained: these logics ’ derivability problem is in the second step of the polynomial hierarchy. For certain logics, though, we discover a complexity jump to PSPACEcompleteness, which is a new phenomenon for Justification Logic.