no code implementations • 19 May 2023 • Teemu Hankala, Miika Hannula, Juha Kontinen, Jonni Virtema
It is thus open, and equivalent with the decidability of the existential theory of the reals with the exponential function, whether training neural networks using the sigmoid activation function is algorithmically solvable.
no code implementations • 7 Oct 2020 • Jonni Virtema, Jana Hofmann, Bernd Finkbeiner, Juha Kontinen, Fan Yang
We study the expressivity and complexity of model checking linear temporal logic with team semantics (TeamLTL).
Logic in Computer Science Computational Complexity F.4.1; D.2.4
no code implementations • 19 Sep 2013 • Miika Hannula, Juha Kontinen
We present a complete finite axiomatization of the unrestricted implication problem for inclusion and conditional independence atoms in the context of dependence logic.
