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 cs.LOShow all

15 papers · 1 filter

cs.LO2023

Short Boolean Formulas as Explanations in Practice

Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto +2

We investigate explainability via short Boolean formulas in the data model based on unary relations. As an explanation of length k, we take a Boolean formula of length k that minim…

cs.LO2023

Descriptive complexity for distributed computing with circuits

Veeti Ahvonen, Damian Heiman, Lauri Hella +1

We consider distributed algorithms in the realistic scenario where distributed message passing is operated via circuits. We show that within this setting, modal substitution calcul…

cs.LO2022

On expressive rule-based logics

Antti Kuusisto

We investigate a family of rule-based logics. The focus is on very expressive languages. We provide a range of characterization results for the expressive powers of the logics and…

cs.LO2021

One-Dimensional Fragment over Words and Trees

Emanuel Kieronski, Antti Kuusisto

One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential (universal) quantifiers that leave at most one variable free. We in…

cs.LO2021

Description logics as polyadic modal logics

Jonne Iso-Tuisku, Antti Kuusisto

We study extensions of standard description logics to the framework of polyadic modal logic. We promote a natural approach to such logics via general relation algebras that can be…

cs.LO2020★ 2 cited

Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants

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…