#### Filter Results:

- Full text PDF available (32)

#### Publication Year

2007

2019

- This year (5)
- Last 5 years (30)
- Last 10 years (48)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
- MFCS
- 2015

We investigate the computational complexity of the satisfiability problem of modal inclusion logic. We distinguish two variants of the problem: one for strict and another one for lax semantics. The… (More)

- Lauri Hella, Matti Järvisalo, +5 authors Jonni Virtema
- Distributed Computing
- 2013

This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and study models of computing that are weaker versions of the… (More)

- Emanuel Kieronski, Antti Kuusisto
- CSL
- 2015

The uniform one-dimensional fragment U1 of first-order logic was introduced recently as a natural generalization of the two-variable fragment FO2 to contexts with relation symbols of all arities. It… (More)

- Antti Kuusisto
- Description Logics
- 2016

The uniform one-dimensional fragment of first-order logic, U1, is a recently introduced formalism that extends two-variable logic in a natural way to contexts with relations of all arities. We survey… (More)

- Lauri Hella, Antti Kuusisto
- Advances in Modal Logic
- 2014

We introduce a novel decidable fragment of first-order logic. The fragment is onedimensional in the sense that quantification is limited to applications of blocks of existential (universal)… (More)

- Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema
- LICS
- 2011

- Emanuel Kieronski, Antti Kuusisto
- MFCS
- 2014

Uniform one-dimensional fragment UF= 1 is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers such that at most one… (More)

- Lauri Hella, Matti Järvisalo, +5 authors Jonni Virtema
- PODC
- 2012

This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker versions of the… (More)

- Valentin Goranko, Antti Kuusisto, Raine Rönnholm
- ACM Trans. Comput. Log.
- 2016

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)

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

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)