The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time

In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The paper characterizes the complexity of model checking branching time logics of knowledge in finite state systems with respect to the clock semantics.

• Type: Conference
• Year: 2010
• Where: ECAI
• Authors: Xiaowei Huang, Ron van der Meyden
• Keywords: Artificial Intelligence, Branching Time Logics, Clock Semantics, ECAI 2010, Epistemic Logic