activity
20102026
most citedHierarchies in independence logic

21 citations · 116 across the 38 of their papers we have counts for

collaborators
Showing 2023Show all

5 papers · 1 filter

cs.LO2023

Logics with probabilistic team semantics and the Boolean negation

Miika Hannula, Minna Hirvonen, Juha Kontinen +3

We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic ind…

cs.LO2023★ 1 cited

Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions

Teemu Hankala, Miika Hannula, Juha Kontinen +1

We study the complexity of the problem of training neural networks defined via various activation functions. The training problem is known to be existsR-complete with respect to li…

cs.LO2023

Set Semantics for Asynchronous TeamLTL: Expressivity and Complexity

Juha Kontinen, Max Sandström, Jonni Virtema

We introduce and develop a set-based semantics for asynchronous TeamLTL. We consider two canonical logics in this setting: the extensions of TeamLTL by the Boolean disjunction and…

cs.LO2023★ 2 cited

Unified Foundations of Team Semantics via Semirings

Timon Barlag, Miika Hannula, Juha Kontinen +2

Semiring semantics for first-order logic provides a way to trace how facts represented by a model are used to deduce satisfaction of a formula. Team semantics is a framework for st…

cs.LO2023

Parameterized Complexity of Weighted Team Definability

Juha Kontinen, Yasir Mahmood, Arne Meier +1

In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analogue of one of the most studied problems in par…