We investigate the complexity of the model checking problem for distributed knowing how. We show that the problem is $Δ^p_2$-complete.
We investigate the complexity of the model checking problem for distributed knowing how. We show that the problem is $Δ^p_2$-complete.