--- title: Epistemic Logic of Cops and Robbers url: https://www.emergentmind.com/topics/epistemic-logic-of-cops-and-robbers-elcr type: topic --- # Epistemic Logic of Cops and Robbers Searching arXiv for the specified ELCR and related papers to ground the article in current research. Epistemic Logic of Cops and Robbers (ELCR) is a dynamic-epistemic logic for pursuit–evasion on directed graphs under imperfect information. In its canonical formulation, ELCR combines a first-order–flavored static language for graph structure and player positions, epistemic operators for knowledge of values and formulas, and a bespoke dynamic operator that updates both positions and information states after moves. The framework was introduced to make precise such notions as players’ positions, observational power, inference, and information update in Cops and Robbers / Hide and Seek, and it is accompanied by axiomatization and decidability results [2508.00004]. A closely related line of work recasts generalized multi-agent Cops and Robbers as a reactive synthesis problem using LTL, LTLt, and KLTL, thereby providing a complementary algorithmic perspective on imperfect information, memory, and communication in pursuit–evasion [2503.11475]. ## 1. Game-theoretic setting and epistemic motivation ELCR studies a turn-based game on a finite, directed, serial graph $(D,R)$, where seriality means that every vertex has at least one outgoing edge: $\forall s\in D\;\exists t\in D:(s,t)\in R$. The core two-player setting has Cop $X$ and Robber $Y$, represented by variables $x$ and $y$. A situation is a pair of vertices indicating the current positions of $x$ and $y$. In the main setting, each round consists of a move by the cop followed by a move by the robber, and the turn order is common knowledge. A legal move takes the current player from vertex $s$ to some $t$ with $(s,t)\in R$ [2508.00004]. The central departure from classical perfect-information formulations is imperfect information governed by a $k$-sight model. Players always know their own position. A player $z$ can see another player $z'$ iff the distance, measured in the undirected sense via the symmetric closure of $R$, is at most $k$. The paper defines neighborhoods inductively by \[ \mathbb{D}^0(s):=\{s\},\qquad \mathbb{D}^{m+1}(s):=\mathbb{D}^m(s)\cup\{ t\in D : \exists u\in \mathbb{D}^m(s)[(u,t)\in R \ \text{or}\ (t,u)\in R]\}. \] Hence $t\in \mathbb{D}^k(s)$ means that $t$ is within $k$ undirected steps of $s$. The $k$-sight condition guarantees what players can know at least by direct observation, but the framework also allows them to know more by reasoning from graph structure and prior information [2508.00004]. This informational shift changes the winning condition. Instead of taking capture alone as primitive, the ELCR paper fixes a natural number $n\in\mathbb{N}$ and says that Cop $X$ wins iff the position of robber $Y$ is known by $X$ within $n$ rounds. The point is not that physical capture disappears from the theory, but that knowledge of location becomes a formal objective in its own right. This distinguishes ELCR from graph-theoretic treatments in which all players see the full state and winning is defined only by co-location [2508.00004]. The precursor synthesis formalization exhibits the same motivation from another angle. It starts from the classical graph arena $A=(V,E)$ with positions for cops and robbers, discrete synchronous rounds, non-collision and no-switching constraints, and then adds an explicitly imperfect-information version in which “players see only their adjacent neighbors.” There, knowledge constraints are written in KLTL as part of a baseline specification $\Phi$, including \[ \mathbf{G}\,\Bigl(\neg \text{Adjacent} \to \bigl(\neg K_{\text{Cop}(\text{RobberPos})} \land \neg K_{\text{Robber}(\text{CopPos})}\bigr)\Bigr), \] which states that if cop and robber are not adjacent, then neither side knows the other’s position [2503.11475]. This is not yet ELCR proper, but it establishes the same epistemic problem space. ## 2. Language, vocabulary, and model structure ELCR is built over a vocabulary $Voc=(Pred,Cons,Var)$, where $Pred$ is a set of predicate symbols including a distinguished binary symbol $R$ for graph edges, $Cons$ is a finite non-empty set of constants naming vertices, and $Var=\{x,y\}$ are the player-variables. Terms are $Term:=Cons\cup Var$. Thus the current position of a player is treated as the value of a variable, while graph vertices may also be referred to by constant names [2508.00004]. The language is stratified into three levels. The Boolean fragment $\mathcal{L}_{\mathsf{B}}$ contains atomic predicates and equality: \[ \alpha ::= P(t_1,\dots,t_n)\mid t_1\equiv t_2\mid \neg \alpha\mid (\alpha\land \alpha). \] The dynamic extension $\mathcal{L}_{\mathsf{BD}}$ adds formulas of the form $[z]\psi$, read as “after any move of player $z$, $\psi$ holds.” The full language $\mathcal{L}$ adds two epistemic forms: \[ K_z t,\qquad K_z\varphi, \] read respectively as “player $z$ knows the value of term $t$” and “player $z$ knows that $\varphi$” [2508.00004]. Semantically, an ELCR model is a tuple \[ M=(D,I,\Sigma,\sim). \] Here $D$ is a non-empty finite domain of vertices, $I$ interprets predicate symbols and constants, $\Sigma\subseteq D^{Var}$ is a non-empty set of situations, and for each player $z\in\{x,y\}$, $\sim_z$ is an equivalence relation on $\Sigma$ encoding epistemic indistinguishability. Name completeness is imposed: for each $s\in D$ there exists $c\in Cons$ with $I(c)=s$. This ensures that the domain is fully named by constants [2508.00004]. A $k$-sight model is then a model satisfying the visibility constraint: if $\sigma\sim_z\sigma'$ and player $z'$ is within $\mathbb{D}^k(\sigma(z))$ in situation $\sigma$, then $\sigma(z')=\sigma'(z')$. In other words, whenever another player is within sight radius $k$, that player’s position is constant across all situations that $z$ considers possible [2508.00004]. The truth clauses for the epistemic operators are standardly relational: \[ M,\sigma\models K_z t \quad\text{iff}\quad \forall \sigma'\in\Sigma\,(\sigma'\sim_z\sigma \Rightarrow t^{(I,\sigma)}=t^{(I,\sigma')}), \] and \[ M,\sigma\models K_z\varphi \quad\text{iff}\quad \forall \sigma'\in\Sigma\,(\sigma'\sim_z\sigma \Rightarrow M,\sigma'\models\varphi). \] The distinction between $K_zt$ and $K_z\varphi$ is significant. ELCR makes “knowing the value of a term” primitive rather than reducing it entirely to formula knowledge; this aligns it with logics of epistemic dependence while keeping the game-theoretic reading explicit [2508.00004]. The language also contains object-level distance formulas. Define \[ \mathsf{D}^0 t_1 t_2 := t_1\equiv t_2, \] and \[ \mathsf{D}^{n+1} t_1 t_2 := \mathsf{D}^n t_1 t_2 \lor \bigvee_{t\in Var\cup Cons}(\mathsf{D}^n t_1 t \land (Rtt_2\lor Rt_2 t)). \] Then $\mathsf{D}^k z t$ expresses that the value of $t$ is within sight radius $k$ of player $z$. A key validity is \[ \mathsf{D}^k z t \to K_z t, \] which internalizes the $k$-sight assumption into the object language [2508.00004]. ## 3. Dynamic update and information change The most distinctive feature of ELCR is the dynamic operator $[z]$, intended to mean “after any legal move of player $z$, $\varphi$ holds.” Its semantics is not a generic temporal successor clause, but a model update that simultaneously accounts for movement, visibility, and inference [2508.00004]. For each player $z$, ELCR defines a movement relation $\mathsf{R}^z$ on assignments: $\mathsf{R}^z\sigma\sigma'$ iff $(\sigma(z),\sigma'(z))\in I(R)$ and the other player’s value is unchanged. For a set of situations $\Sigma$, $\mathsf{R}^z(\Sigma)$ is the set of all one-step successors reachable by a move of $z$. The update also uses the “relevant” subset \[ \Sigma\mid\sigma := \{\sigma'\in\Sigma \mid \sigma\sim_x\sigma' \ \text{or}\ \sigma\sim_y\sigma'\}, \] that is, the situations compatible with at least one player’s current epistemic state [2508.00004]. The truth condition for $[z]\varphi$ at $(M,\sigma_1)$ is: \[ M,\sigma_1\models [z]\varphi \quad\text{iff}\quad \forall \sigma_2\in \mathsf{R}^z(\sigma_1): (D,I,\Sigma',\sim'),\sigma_2\models \varphi, \] where the updated model $(D,I,\Sigma',\sim')$ depends on whether the players are in sight after the move. If they are in sight, then \[ \Sigma'=\{\sigma_2\}; \] everyone learns the exact situation. If they are not in sight, then \[ \Sigma'=\{\sigma'\in \mathsf{R}^z(\Sigma\mid\sigma_1)\mid \sigma'(x)\notin \mathbb{D}^k(\sigma'(y))\}. \] The updated epistemic relations are regenerated by own-position identity: \[ \sigma_1'\sim_z'\sigma_2' \quad\text{iff}\quad \sigma_1'(z)=\sigma_2'(z). \] Thus, after each move, each player knows exactly her own position, while uncertainty about the other is shaped by visibility and by elimination of impossible alternatives [2508.00004]. Two points are structurally important. First, the use of $\Sigma\mid\sigma$ is designed to prevent pathological forgetting; the paper proves that if a player knows the other’s position, moving does not erase that knowledge: \[ M,\sigma\models K_zz' \;\Rightarrow\; M,\sigma\models [z]K_zz'. \] Second, sequential and simultaneous movement are not interdefinable in the naive way. A simultaneous operator $[Var]$ can be defined, but \[ [z][z']\varphi \leftrightarrow [Var]\varphi \] is not valid for $z\neq z'$, because sequential updating yields more informational refinement than a single simultaneous step [2508.00004]. The worked example in the ELCR paper shows how this update mechanism captures reasoning beyond direct sight. In a graph with vertices $0$–$5$ and sight $1$, the cop begins at $0$ and the robber at $4$. Initially, the cop can exclude positions visible from $0$ and infer that the robber is at $2$, $3$, or $4$. After a move from $0$ to $1$, one candidate situation is eliminated because it would have brought the robber into sight; after the robber’s subsequent move and a second cop move, the updated possibility set collapses to a singleton. At that point the cop knows the robber’s exact location even though their graph distance is $2$ and they are not in one another’s sight [2508.00004]. ELCR therefore treats non-observation as informative. ## 4. Axiomatization, reduction, and decidability The static fragment without dynamic operators is denoted $ELCR^{-}$. Its Hilbert system contains four blocks: propositional and equality axioms; axioms for game structure and sight such as seriality, “at-some-where,” and the $k$-sight axiom $\mathsf{D}^kzt\to K_zt$; epistemic axioms and rules for $K_z\alpha$ where $\alpha\in\mathcal{L}_{\mathsf{B}}$; and interaction principles connecting value knowledge to propositional knowledge, such as \[ (K_z T\land P(t_1,\dots,t_m))\to K_z P(t_1,\dots,t_m) \] when the agent knows the values of all arguments of a true atomic fact [2508.00004]. The paper proves that $\mathbf{ELCR}^{-}$ is sound for $k$-sight models. It then constructs a canonical model from maximally consistent sets, establishes that distinct maximally consistent sets correspond to distinct situations, proves a Truth Lemma, and derives completeness: every consistent $\Gamma\subseteq L^{-}$ is satisfiable in a $k$-sight model. Compactness follows, and because satisfiable formulas have finite canonical models and the system is finitely axiomatized, $ELCR^{-}$ is decidable [2508.00004]. For the full dynamic logic, the axiomatization proceeds by reduction. The paper gives reduction axioms $(\mathtt{R1})$–$(\mathtt{R10})$ eliminating $[z]$ in favor of static formulas. At the Boolean level, \[ [z]\alpha \leftrightarrow \bigwedge_{T\subseteq Cons}(Rz = T \to \bigwedge_{c\in T} \alpha[c/z]), \] together with the expected clauses for negation and conjunction. More specialized reductions handle knowledge after movement, including $[z]K_zz'$, $[z]K_{z'}z$, $[z]K_z\alpha(z')$, and $[z]K_{z'}\alpha(z)$ under the various cases in which sight or prior uncertainty determine what can be inferred after a move [2508.00004]. These reduction axioms yield a complete dynamic system $\mathbf{ELCR}$. The paper proves soundness by verifying the reduction principles against the update semantics, then proves completeness by reducing every consistent dynamic theory to an equivalent static one and invoking completeness of $\mathbf{ELCR}^{-}$. As a consequence, ELCR is compact and decidable [2508.00004]. The established metatheory is exact but deliberately limited in scope. Higher-order knowledge such as $K_xK_y c$ is excluded from the object language. The basic framework is two-player, turn-based, and uses fixed move order. Sight is deterministic and symmetric, and the object language does not include probabilistic or noisy observations. The paper explicitly lists possible extensions: multiple cops with differing sights $k_z$, distributed knowledge, simultaneous-move axiomatization, alternative winning conditions, probabilistic variants, and limited-memory enrichments. It also states that, beyond decidability, further complexity analysis remains to be done: static model checking is $P$-complete, whereas the dynamic case remains open [2508.00004]. ## 5. Relation to dynamic epistemic logic, strategy logics, and reactive synthesis ELCR is closely related to dynamic epistemic logic (DEL), but it does not merely import a standard product update. The paper compares its built-in operator $[z]$ with a DEL treatment in which moves are represented by event models whose events are edges $(s,t)\in I(R)$, with preconditions saying that the moving player is at $s$ and postconditions updating that player’s position to $t$. The comparison shows that DEL product update can reproduce the same relevant epistemic states, but ELCR achieves this more directly because it updates only the positional and visibility structure needed for the pursuit–evasion setting [2508.00004]. A common misconception is therefore that $[z]$ is just syntactic sugar for “next”; in ELCR it is a domain-specific dynamic operator with an endogenous epistemic update. The framework also sits near earlier logics of graph games. The ELCR paper presents it as a successor to Hide and Seek logics and to relation-changing and sabotage-style graph logics, but distinguishes it by explicitly modeling partial information induced by sight. Its static component is further connected to logics of epistemic dependence, since $K_zt$ behaves as a “knowing the value” operator specialized to player positions [2508.00004]. At the level of strategy reasoning, a useful comparison point is Epistemic Strategy Logic (ESL), which extends Strategy Logic with knowledge operators and strategy quantifiers over epistemic concurrent game models. ESL formulas include atomic propositions, temporal operators $X$ and $U$, epistemic operators $K_i$, and existential strategy quantification $\exists x_i$. It supports de dicto and de re distinctions such as $K_i\exists x_j\phi$ versus $\exists x_j K_i\phi$, and its model-checking complexity is stated to be PTIME-complete in the size of the model, NON-ELEMENTARYTIME in the size of the formula, with $k$-EXPSPACE-hardness for bounded alternation depth [1404.0837]. ESL is not ELCR, but it provides a general framework for reasoning about knowledge of strategies; this suggests one route for extending ELCR from knowledge of positions to knowledge of strategic choices. A second adjacent line comes from reactive synthesis. The 2025 synthesis paper formalizes generalized multi-agent Cops and Robbers using LTL, LTLt, and KLTL, treating the game as a standard turn-based input/output synthesis problem rather than as a concurrent game structure. The generalized imperfect-information version states that “players see only their adjacent neighbors,” and uses KLTL to encode knowledge constraints inside a baseline specification $\Phi$. Variants then conjoin additional temporal goals such as safe-zone alternation or information-sharing clauses like \[ \mathbf{G}\bigl( \text{CopsWithin}_R \to \text{ShareView} \bigr) \] and memory clauses such as \[ \mathbf{G}\Bigl( (\text{InZone} \land \text{WallSeen}) \to \mathbf{G}\,(\text{WallRemembered}) \Bigr). \] The same paper proposes coordination synthesis with agents and a manager modeled as CSP processes, separating Public Actions and Private Actions, where Public Actions “represent the information that is shared throughout the system” and Private Actions encode more subtle local choices [2503.11475]. This suggests a close structural affinity between ELCR’s information update semantics and synthesis-based knowledge-aware controller construction. ## 6. Variants, limitations, and broader research directions The ELCR paper is explicit that its object language excludes higher-order knowledge and that its main semantics is tailored to two players with fixed turn order. Simultaneous moves are discussed only in a sketched extension, multiple cops and robbers are proposed but not fully developed, and sight is deterministic and symmetric. These are not accidental omissions but delimit a decidable core. A second misconception is therefore that ELCR already provides a full multi-agent epistemic game logic for pursuit–evasion. What it provides, more precisely, is a first formal and decidable dynamic-epistemic core for imperfect-information Cops and Robbers [2508.00004]. The synthesis literature points to one major direction of expansion. The reactive-synthesis formulation introduces finite and infinite grids, multiple cops and robbers, safe zones, wall memory, information sharing, and LTL/LTLt specifications over graph movement. It also emphasizes state explosion: direct propositional encoding of an $N\times M$ grid with $C$ cops and $R$ robbers yields $(N+M)^{C+R}$ states, with the example of a $10\times 10$ grid with $2$ cops and $1$ robber producing $1{,}000{,}000$ states, motivating LTLt and Boolean abstraction [2503.11475]. A plausible implication is that any large-scale ELCR for synthesis or verification will need similarly symbolic encodings of positions, observations, and epistemic indistinguishability. Another direction is asymptotic and structural. In large random graphs, a separate line of work studies winning possibilities through first-order definability and zero–one laws. There the underlying game is classical and perfect-information: players are assumed to have perfect information, and several winning conditions are analyzed through extension-axiom-type first-order formulas. The paper proves, for example, that in $G(N,p)$ with constant $0