|uʵWU- 1a&S_SHFx*lCoczKtkU]x,;+&huA8AYHyrOj b-j NkTTa0lʏ:MH-:6 $EmabSz`W-k'"> GZrL5m J[D.fuSҨ\ j#qŀ۽\5m̨qb9U)o+n{Nʐ-bHw,ˋm} n._TtĄAXCTxQ'*v:ǖG:l[pG' {9_*v of reasoning over multi-agent systems with epistemic notions. In this talk, I will present how the complexity of the satisfiability problem for ATEL with epistemic operators for common and distributed knowledge can be settled at ExpTime- complete. Thus the knowledge operators come for free: ATEL has the same computational complexity as ATL.