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

Xiaowei Huang, Ron van der Meyden · Frontiers in artificial intelligence and applications · 2010

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.

Read the paper · More papers on PaperTik