for allλ∈Plays(S tb(G),v 0) such thatλ[j+1]∈ {δ tb(λ[j],α)|α∈act tb(λ[j])andstr r(λ[j])⊑α}there is ani≥0, s.t

there is a functionstr r :S tb →Act skip withstr r(s)∈act tb(r,s), s

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.LO · 2026-04-04 · unverdicted · novelty 6.0

The paper introduces an ATL*-based temporal and epistemic logic framework for analyzing winning strategies in sabotage games on dynamic graphs.

Showing 1 of 1 citing paper.

Strategies in Sabotage Games: Temporal and Epistemic Perspectives cs.LO · 2026-04-04 · unverdicted · none · ref 36
The paper introduces an ATL*-based temporal and epistemic logic framework for analyzing winning strategies in sabotage games on dynamic graphs.