#### Filter Results:

- Full text PDF available (32)

#### Publication Year

2007

2017

- This year (8)
- Last 5 years (30)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Lauri Hella, Matti Järvisalo, +5 authors Jonni Virtema
- Distributed Computing
- 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 widely-studied port-numbering model. In the port-numbering model, a node of degree <i>d</i> receives messages through <i>d</i> input ports and it sends messages… (More)

- Antti Kuusisto
- Journal of Logic, Language and Information
- 2015

We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of a generalized atom. We define a system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework. The semantics is based on… (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 complexity of the lax version turns out to be complete for EXPTIME, whereas with strict semantics, the problem becomes NEXPTIME-complete.

- Juha Kontinen, Antti Kuusisto, Jonni Virtema
- MFCS
- 2016

We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIME-complete. Furthermore, we show that the validity problem of two-variable dependence logic is undecidable, thereby solving an open problem from the team semantics literature. We… (More)

- Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
- ArXiv
- 2016

Modal inclusion logic is a formalism that belongs to the family of logics based on team semantics. This article investigates the model checking and validity problems of propositional and modal inclusion logics. We identify complexity bounds for both problems, covering both lax and strict team semantics. Thereby we tie some loose ends related to the… (More)

- Fan Yang, Jouko A. Väänänen, +11 authors Heribert Vollmer
- 2014

Dependence logic is a new logic which incorporates the notion of “dependence”, as well as “independence” between variables into first-order logic. In this thesis, we study extensions and variants of dependence logic on the first-order, propositional and modal level. In particular, the role of intuitionistic connectives in this setting is emphasized. We… (More)

- Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema
- 2011 IEEE 26th Annual Symposium on Logic in…
- 2011

We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and… (More)

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

We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in the quantified formula. The fragment is closed under Boolean operations, but additional restrictions (called… (More)

- Cristina Feier, Antti Kuusisto, Carsten Lutz
- ICDT
- 2017

We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of the ALC family and on conjunctive queries. We show that rewritability into FO and into monadic Datalog (MDLog) are decidable, and that rewritability into Datalog is decidable… (More)

- 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 variable remains free in the quantified formula. The fragment is closed under Boolean operations, but additional restrictions (called uniformity conditions)… (More)