The Complexity of Model Checking Knowledge and Time
Abstract
We establish the precise complexity of the model checking problem for the main logics of knowledge and time. While this problem was known to be non-elementary for agents with perfect recall, with a number of exponentials that increases with the alternation of knowledge operators, the precise complexity of the problem when the maximum alternation is fixed has been an open problem for twenty years. We close it by establishing improved upper bounds for CTL* with knowledge, and providing matching lower bounds that also apply for epistemic extensions of LTL and CTL.
Cite
Text
Bozzelli et al. "The Complexity of Model Checking Knowledge and Time." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/221Markdown
[Bozzelli et al. "The Complexity of Model Checking Knowledge and Time." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/bozzelli2019ijcai-complexity/) doi:10.24963/IJCAI.2019/221BibTeX
@inproceedings{bozzelli2019ijcai-complexity,
title = {{The Complexity of Model Checking Knowledge and Time}},
author = {Bozzelli, Laura and Maubert, Bastien and Murano, Aniello},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2019},
pages = {1595-1601},
doi = {10.24963/IJCAI.2019/221},
url = {https://mlanthology.org/ijcai/2019/bozzelli2019ijcai-complexity/}
}