#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2015

2017

- This year (4)
- Last 5 years (7)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Raine Rönnholm
- ArXiv
- 2015

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 be expressed with a formula of k-ary existential second order logic, ESO[k]. Conversely, every formula of ESO[k] with at most k-ary free relation variables can… (More)

- Valentin Goranko, Antti Kuusisto, Raine Rönnholm
- AAMAS
- 2016

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, and thus the game-theoretic perspective appears in the framework of ATL on two semantic levels: on the object level, in the standard semantics of the strategic… (More)

- Valentin Goranko, Antti Kuusisto, Raine Rönnholm
- AAMAS
- 2017

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 game-theoretic semantics is equivalent to the standard compositional semantics of ATL + (with perfect-recall strategies). Based on the new semantics, we provide an… (More)

- Lauri Hella, Antti Kuusisto, Raine Rönnholm
- ArXiv
- 2017

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. Infinite paths are not needed even when the considered transition system is infinite.

- Fausto Barbero, Lauri Hella, Raine Rönnholm
- WoLLIC
- 2017

- Valentin Goranko, Antti Kuusisto, Raine Rönnholm
- ArXiv
- 2017

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 rational players in such games and analyze which classes of coordination games can be solved by such players with no preplay communication or conventions. We… (More)

- Raine Rönnholm
- WoLLIC
- 2016

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 exclusion logic is equivalent with dependence logic. From the translations between them we see that the expressive power of EXC[k] lies in between k-ary and (k +1)-ary… (More)

- ‹
- 1
- ›