Work

The Model Checking Problem for Distributed Knowing How is $Δ^p_2$-Complete

Year: 2026
Type: preprint
Abstract: We investigate the complexity of the model checking problem for distributed knowing how. We show that the problem is $Δ^p_2$-complete.
Open Access status: green
OpenAlex ID: W7166177666
Cites:
Cited by:
Related to: