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.
Source: arXiv (Cornell University)
Authors: Wang, Ziqi, de Haan, Ronald
Institution: University of Amsterdam
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7166177666
Cites:
Cited by:
Related to:
