40 citations · 44 across the 19 of their papers we have counts for
1 paper · 1 filter
Antonis Achilleos
We provide a lower complexity bound for the satisfiability problem of a multi-agent justification logic, establishing that the general NEXP upper bound from our previous work is ti…