An Epistemic Halpern-Shoham Logic
Abstract
We define a family of epistemic extensions of Halpern-Shoham logic for reasoning about temporal-epistemic properties of multi-agent systems. We exemplify their use and study the complexity of their model checking problem. We show a range of results ranging from PTIME to PSPACE-hard depending on the logic considered.
Cite
Text
Lomuscio and Michaliszyn. "An Epistemic Halpern-Shoham Logic." International Joint Conference on Artificial Intelligence, 2013.Markdown
[Lomuscio and Michaliszyn. "An Epistemic Halpern-Shoham Logic." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/lomuscio2013ijcai-epistemic/)BibTeX
@inproceedings{lomuscio2013ijcai-epistemic,
title = {{An Epistemic Halpern-Shoham Logic}},
author = {Lomuscio, Alessio and Michaliszyn, Jakub},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2013},
pages = {1010-1016},
url = {https://mlanthology.org/ijcai/2013/lomuscio2013ijcai-epistemic/}
}