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. © 2019 International Joint Conferences on Artificial Intelligence. All rights reserved.
The complexity of model checking knowledge and time / Bozzelli, L.; Maubert, B.; Murano, A.. - In: IJCAI. - ISSN 1045-0823. - 2019-August:(2019), pp. 1595-1601. (Intervento presentato al convegno International Joint Conference on Artificial Intelligence tenutosi a Macao, China nel 10 August - 16 August 2019) [10.24963/ijcai.2019/221].
The complexity of model checking knowledge and time
Bozzelli, L.
Membro del Collaboration Group
;Maubert, B.
Membro del Collaboration Group
;Murano, A.
Membro del Collaboration Group
2019
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. © 2019 International Joint Conferences on Artificial Intelligence. All rights reserved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
