LOJun 25
The Model Checking Problem for Distributed Knowing How is $Δ^p_2$-Complete
arXiv:2606.267091.0
Predicted impact top 98% in LO · last 90 daysOriginality Incremental advance
AI Analysis
For researchers in logic and multi-agent systems, this provides a precise complexity classification for a previously open problem.
The paper proves that the model checking problem for distributed knowing how is $Δ^p_2$-complete, establishing its exact computational complexity.
We investigate the complexity of the model checking problem for distributed knowing how. We show that the problem is $Δ^p_2$-complete.