Extended Modal Dependence Logic. - Johannes Ebbing; Lauri Hella; Arne Meier; Julian-Steffen Müller; Jonni Virtema; Heribert Vollmer (WoLLIC, 2013)

Undecidable First-Order Theories of Affine Geometries. - Antti Kuusisto; Jeremy Meyers; Jonni Virtema (Log. Methods Comput. Sci., 2013)

The Expressive Power of Modal Dependence Logic. - Lauri Hella; Kerkko Luosto; Katsuhiko Sano; Jonni Virtema (Advances in Modal Logic, 2014)

Decidable Fragments of Logics Based on Team Semantics. - Juha Kontinen; Antti Kuusisto; Jonni Virtema (CoRR, 2014)

Complexity of validity for propositional dependence logics. - Jonni Virtema (GandALF, 2014)

Complexity of two-variable dependence logic and IF-logic. - Juha Kontinen; Antti Kuusisto; Peter Lohmann; Jonni Virtema (Inf. Comput., 2014)

Approaches to Finite Variable Dependence: Expressiveness and Computational Complexity ; Riippuvuus äärellisten muuttujajoukkojen logiikoissa. - Jonni Virtema (2014)

Axiomatizing Propositional Dependence Logics. - Katsuhiko Sano; Jonni Virtema (CSL, 2015)

Complexity of Propositional Independence and Inclusion Logic. - Miika Hannula; Juha Kontinen; Jonni Virtema; Heribert Vollmer (MFCS (1), 2015)

A Team Based Variant of CTL. - Andreas Krebs; Arne Meier; Jonni Virtema (TIME, 2015)

Characterizing Frame Definability in Team Semantics via the Universal Modality. - Katsuhiko Sano; Jonni Virtema (WoLLIC, 2015)

Parallel Computational Tree Logic. - Andreas Krebs; Arne Meier; Jonni Virtema (CoRR, 2015)

Weak models of distributed computing, with connections to modal logic. - Lauri Hella; Matti Järvisalo; Antti Kuusisto; Juhana Laurinharju; Tuomo Lempiäinen; Kerkko Luosto; Jukka Suomela; Jonni Virtema (Distributed Comput., 2015)

Decidability of Predicate Logics with Team Semantics. - Juha Kontinen; Antti Kuusisto; Jonni Virtema (MFCS, 2016)

Characterizing Relative Frame Definability in Team Semantics via the Universal Modality. - Katsuhiko Sano; Jonni Virtema (WoLLIC, 2016)

On Quantified Propositional Logics and the Exponential Time Hierarchy. - Miika Hannula; Juha Kontinen; Martin Lück; Jonni Virtema (GandALF, 2016)

Boolean dependence logic and partially-ordered connectives. - Johannes Ebbing; Lauri Hella; Peter Lohmann; Jonni Virtema (J. Comput. Syst. Sci., 2017)

Expressivity Within Second-Order Transitive-Closure Logic. - Flavio Ferrarotti; Jan Van den Bussche; Jonni Virtema (CSL, 2018)

Probabilistic Team Semantics. - Arnaud Durand 001; Miika Hannula; Juha Kontinen; Arne Meier; Jonni Virtema (FoIKS, 2018)

Team Semantics for the Specification and Verification of Hyperproperties. - Andreas Krebs; Arne Meier; Jonni Virtema; Martin Zimmermann 002 (MFCS, 2018)

Approximation and dependence via multiteam semantics. - Arnaud Durand 001; Miika Hannula; Juha Kontinen; Arne Meier; Jonni Virtema (Ann. Math. Artif. Intell., 2018)

Complexity of Propositional Logics in Team Semantic. - Miika Hannula; Juha Kontinen; Jonni Virtema; Heribert Vollmer (ACM Trans. Comput. Log., 2018)

Facets of Distribution Identities in Probabilistic Team Semantics. - Miika Hannula; Åsa Hirvonen; Juha Kontinen; Vadim Kulikov; Jonni Virtema (JELIA, 2019)

Fully Generic Queries: Open Problems and Some Partial Answers. - Dimitri Surinx; Jan Van den Bussche; Jonni Virtema (MEDI, 2019)

Descriptive Complexity of Deterministic Polylogarithmic Time. - Flavio Ferrarotti; Senén González; José Maria Turull Torres; Jan Van den Bussche; Jonni Virtema (WoLLIC, 2019)

Characterising modal definability of team-based logics via the universal modality. - Katsuhiko Sano; Jonni Virtema (Ann. Pure Appl. Log., 2019)

Model checking and validity in propositional and modal inclusion logics. - Lauri Hella; Antti Kuusisto; Arne Meier; Jonni Virtema (J. Log. Comput., 2019)

Descriptive complexity of real computation and probabilistic independence logic. - Miika Hannula; Juha Kontinen; Jan Van den Bussche; Jonni Virtema (LICS, 2020)

Polyteam semantics. - Miika Hannula; Juha Kontinen; Jonni Virtema (J. Log. Comput., 2020)

On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. - Miika Hannula; Juha Kontinen; Martin Lück; Jonni Virtema (CSL, 2021)

Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity. - Jonni Virtema; Jana Hofmann; Bernd Finkbeiner; Juha Kontinen; Fan Yang 004 (FSTTCS, 2021)

Parameterised Complexity of Propositional Logic in Team Semantics. - Yasir Mahmood 002; Jonni Virtema (CoRR, 2021)

Descriptive complexity of deterministic polylogarithmic time and space. - Flavio Ferrarotti; Senén González; José Maria Turull Torres; Jan Van den Bussche; Jonni Virtema (J. Comput. Syst. Sci., 2021)

Temporal Team Semantics Revisited. - Jens Oliver Gutsfeld; Arne Meier; Christoph Ohrem; Jonni Virtema (LICS, 2022)

Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals. - Miika Hannula; Jonni Virtema (Ann. Pure Appl. Log., 2022)

Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist Counterfactuals. - Fausto Barbero; Jonni Virtema (JELIA, 2023)

Unified Foundations of Team Semantics via Semirings. - Timon Barlag; Miika Hannula; Juha Kontinen; Nina Pardal; Jonni Virtema (KR, 2023)

Parameterized Complexity of Propositional Inclusion and Independence Logic. - Yasir Mahmood 002; Jonni Virtema (WoLLIC, 2023)

A fine-grained framework for database repairs. - Nina Pardal; Jonni Virtema (CoRR, 2023)

Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions. - Teemu Hankala; Miika Hannula; Juha Kontinen; Jonni Virtema (AAAI, 2024)

Expressivity Landscape for Logics with Probabilistic Interventionist Counterfactuals. - Fausto Barbero; Jonni Virtema (CSL, 2024)

A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL. - Juha Kontinen; Max Sandström; Jonni Virtema (FoIKS, 2024)

Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. - Yasir Mahmood 002; Jonni Virtema; Timon Barlag; Axel-Cyrille Ngonga Ngomo (FoIKS, 2024)

Graph Neural Networks and Arithmetic Circuits. - Timon Barlag; Vivian Holzapfel; Laura Strieker; Jonni Virtema; Heribert Vollmer (NeurIPS, 2024)

Synchronous Team Semantics for Temporal Logics. - Andreas Krebs; Arne Meier; Jonni Virtema; Martin Zimmermann 002 (CoRR, 2024)

Rewriting Consistent Answers on Annotated Data. - Phokion G. Kolaitis; Nina Pardal; Jonni Virtema (CoRR, 2024)

Logics for Dependence and Independence: Expressivity and Complexity (Dagstuhl Seminar 24111). - Juha Kontinen; Jonni Virtema; Heribert Vollmer; Fan Yang 004; Nicolas Fröhlich 001 (Dagstuhl Reports, 2024)

Set semantics for asynchronous TeamLTL: Expressivity and complexity. - Juha Kontinen; Max Sandström; Jonni Virtema (Inf. Comput., 2025)

Logics with probabilistic team semantics and the Boolean negation. - Miika Hannula; Minna Hirvonen; Juha Kontinen; Yasir Mahmood 002; Arne Meier; Jonni Virtema (J. Log. Comput., 2025)

Halting Recurrent GNNs and the Graded μ-Calculus. - Jeroen Bollen; Jan Van den Bussche; Stijn Vansummeren; Jonni Virtema (CoRR, 2025)

Local consistency and axioms of functional dependence. - Timon Barlag; Miika Hannula; Juha Kontinen; Nina Pardal; Jonni Virtema (CoRR, 2025)

Rewriting Consistent Answers On Annotated Data. - Phokion G. Kolaitis; Nina Pardal; Jonni Virtema; Jef Wijsen (Proc. ACM Manag. Data, 2025)