中文

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

计算机科学中的逻辑 2026-06-25 v1
作者: Ziqi Wang , Ronald de Haan
在 arXiv 上查看 ↗ PDF ↗

摘要

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

引用

@article{arxiv.2606.26709,
  title  = {The Model Checking Problem for Distributed Knowing How is $Δ^p_2$-Complete},
  author = {Ziqi Wang and Ronald de Haan},
  journal= {arXiv preprint arXiv:2606.26709},
  year   = {2026}
}