Model Checking Temporal Epistemic Logic under Bounded Recall
DOI:
https://doi.org/10.1609/aaai.v34i05.6193Abstract
We study the problem of verifying multi-agent systems under the assumption of bounded recall. We introduce the logic CTLKBR, a bounded-recall variant of the temporal-epistemic logic CTLK. We define and study the model checking problem against CTLK specifications under incomplete information and bounded recall and present complexity upper bounds. We present an extension of the BDD-based model checker MCMAS implementing model checking under bounded recall semantics and discuss the experimental results obtained.
Downloads
Published
2020-04-03
How to Cite
Belardinelli, F., Lomuscio, A., & Yu, E. (2020). Model Checking Temporal Epistemic Logic under Bounded Recall. Proceedings of the AAAI Conference on Artificial Intelligence, 34(05), 7071-7078. https://doi.org/10.1609/aaai.v34i05.6193
Issue
Section
AAAI Technical Track: Multiagent Systems