.png){kind=icon}
.png){kind=icon}
Return
Logics for Dynamic Graph Games
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-031-94748-3_2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With sabotage games on graphs that change during play as a running example, we discuss logics designed for describing such reactive systems, on which there is a growing literature - the collection [12] has the relevant formal details. We consider three zoom levels for these dynamic scenarios: graphs as game boards, extensive game trees, and infinite dynamical systems. We compare these and discuss some of the open problems concerning logic design that arise in this setting.
Keywords:
Graph game
Modal logic
Game logic
Dynamical system
Journal
S
IF:
0
Papers:
20
Citations:
0