We develop a game-theoretic semantics (GTS) for the fragment ATL of the Alternating-time Temporal Logic ATL∗, essentially extending a recently introduced GTS for ATL. We show that the new… (More)

We consider a variation of the branching time logic CTL with non-standard, “finitely bounded” semantics (FBS). FBS is naturally defined as game-theoretic semantics where the proponent of truth of an… (More)

In this paper we analyze k-ary inclusion-exclusion logic, INEX[k], which is obtained by extending first order logic with k-ary inclusion and exclusion atoms. We show that every formula of INEX[k] can… (More)

In this paper we analyze k-ary inclusion-exclusion logic, INEX[k], which is obtained by extending first order logic with k-ary inclusion and exclusion atoms. We show that every formula of INEX[k] can… (More)

We introduce several versions of game-theoretic semantics (GTS) for Alternating-Time Temporal Logic (ATL). In GTS, truth is defined in terms of existence of a winning strategy in a semantic… (More)

We introduce a new game-theoretic semantics (GTS) for the modal μ-calculus. Our so-called bounded GTS replaces parity games with novel alternative evaluation games where only finite paths arise.… (More)

In this paper we study the expressive power of k-ary exclusion logic, EXC[k], that is obtained by extending first order logic with k-ary exclusion atoms. It is known that without arity bounds… (More)

We introduce versions of game-theoretic semantics (GTS) for Alternating-Time Temporal Logic (ATL). In GTS, truth is defined in terms of existence of a winning strategy in a semantic evaluation game,… (More)

We study pure coordination games where in every outcome, all players have identical payoffs, ‘win’ or ‘lose’. We identify and discuss a range of ‘purely rational principles’ guiding the reasoning of… (More)