22 citations · 45 across the 7 of their papers we have counts for
6 papers · 1 filter
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…
Strongly complete axiomatization for a logic with probabilistic interventionist counterfactuals
Fausto Barbero, Jonni Virtema
Causal multiteam semantics is a framework where probabilistic notions and causal inference can be studied in a unified setting. We study a logic (PCO) that features marginal probab…
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…
On Quantified Propositional Logics and the Exponential Time Hierarchy
Miika Hannula, Juha Kontinen, Martin Lück +1
We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize…
Axiomatizing Propositional Dependence Logics
Katsuhiko Sano, Jonni Virtema
We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extend…
The Expressive Power of Modal Dependence Logic
Lauri Hella, Kerkko Luosto, Katsuhiko Sano +1
We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulatio…