activity
20112026
most citedWeak Models of Distributed Computing, with Connections to Modal Logic

31 citations · 83 across the 33 of their papers we have counts for

collaborators
Showing 2017Show all

6 papers · 1 filter

cs.MA2017

Rational coordination with no communication or conventions

Valentin Goranko, Antti Kuusisto, Raine Rönnholm

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' guidin…

math.LO2017

Bounded game-theoretic semantics for modal mu-calculus

Lauri Hella, Antti Kuusisto, Raine Rönnholm

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

cs.FL2017★ 1 cited

Emptiness Problems for Distributed Automata

Antti Kuusisto, Fabian Reiter

We investigate the decidability of the emptiness problem for three classes of distributed automata. These devices operate on finite directed graphs, acting as networks of identical…

math.LO2017★ 1 cited

First-order logic with incomplete information

Antti Kuusisto

We develop first-order logic and some extensions for incomplete information scenarios and consider related complexity issues.

math.LO2017

Game-Theoretic Semantics for ATL+ with Applications to Model Checking

Valentin Goranko, Antti Kuusisto, Raine Rönnholm

We develop game-theoretic semantics (GTS) for the fragment ATL+ of the full Alternating-time Temporal Logic ATL*, essentially extending a recently introduced GTS for ATL. We first…

cs.LO2017★ 23 cited

Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

Cristina Feier, Antti Kuusisto, Carsten Lutz

We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of…