2014/04/03 by Xiaowei Huang, Ron van der Meyden
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.146.5
published as EPTCS 146, 2014, pp. 35-41 · In Proceedings SR 2014, arXiv:1404.0414
arxiv created 2014/04/03 · arxiv updated 2014/04/04
The paper presents an extension of temporal epistemic logic with operators that quantify over strategies. The language also provides a natural way to represent what agents would know were they to be aware of the strategies being used by other agents. Some examples are presented to motivate the framework, and relationships to several variants of alternating temporal epistemic logic are discussed. The computational complexity of model checking the logic is also characterized.