TY - CPAPER AB - 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. AU - Lomuscio,AR AU - Michaliszyn,J EP - 1016 PY - 2013/// SN - 1045-0823 SP - 1010 TI - An epistemic Halpern-Shoham logic ER -