The Model Checking Problem for Distributed Knowing How 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.

Paper

Similar papers

© 2026 NYSGPT2525 LLC