default search action
Jonni Virtema
Person information
- affiliation: University of Sheffield, UK
- affiliation: Leibniz University Hanover, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c37]Teemu Hankala, Miika Hannula
, Juha Kontinen
Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions. AAAI 2024: 12278-12285 - [c36]Fausto Barbero, Jonni Virtema
Expressivity Landscape for Logics with Probabilistic Interventionist Counterfactuals. CSL 2024: 15:1-15:19 - [c35]Yasir Mahmood
Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. FoIKS 2024: 23-42 - [c34]Juha Kontinen
A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL. FoIKS 2024: 275-286 - [i36]Timon Barlag, Vivian Holzapfel, Laura Strieker, Jonni Virtema
Graph Neural Networks and Arithmetic Circuits. CoRR abs/2402.17805 (2024) - [i35]Juha Kontinen, Max Sandström, Jonni Virtema:
A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL. CoRR abs/2406.04833 (2024) - [i34]Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Synchronous Team Semantics for Temporal Logics. CoRR abs/2409.18667 (2024) - [i33]Juha Kontinen, Jonni Virtema, Heribert Vollmer, Fan Yang, Nicolas Fröhlich:
Logics for Dependence and Independence: Expressivity and Complexity (Dagstuhl Seminar 24111). Dagstuhl Reports 14(3): 31-51 (2024) - 2023
- [c33]Fausto Barbero
Strongly Complete Axiomatization for a Logic with Probabilistic Interventionist Counterfactuals. JELIA 2023: 649-664 - [c32]Miika Hannula
Logics with Probabilistic Team Semantics and the Boolean Negation. JELIA 2023: 665-680 - [c31]Timon Barlag, Miika Hannula
Unified Foundations of Team Semantics via Semirings. KR 2023: 75-85 - [c30]Juha Kontinen
Set Semantics for Asynchronous TeamLTL: Expressivity and Complexity. MFCS 2023: 60:1-60:14 - [c29]Yasir Mahmood
Parameterized Complexity of Propositional Inclusion and Independence Logic. WoLLIC 2023: 274-291 - [i32]Timon Barlag, Miika Hannula, Juha Kontinen, Nina Pardal, Jonni Virtema
Unified Foundations of Team Semantics via Semirings. CoRR abs/2303.07926 (2023) - [i31]Fausto Barbero, Jonni Virtema
Expressivity Landscape for Logics with Probabilistic Interventionist Counterfactuals. CoRR abs/2303.11993 (2023) - [i30]Fausto Barbero, Jonni Virtema
Strongly complete axiomatization for a logic with probabilistic interventionist counterfactuals. CoRR abs/2304.02964 (2023) - [i29]Juha Kontinen, Max Sandström, Jonni Virtema
Set Semantics for Asynchronous TeamLTL: Expressivity and Complexity. CoRR abs/2304.10915 (2023) - [i28]Teemu Hankala, Miika Hannula, Juha Kontinen, Jonni Virtema:
Complexity of Neural Network Training and ETR: Extensions with Effectively Continuous Functions. CoRR abs/2305.11833 (2023) - [i27]Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema:
Logics with probabilistic team semantics and the Boolean negation. CoRR abs/2306.00420 (2023) - [i26]Nina Pardal, Jonni Virtema
A fine-grained framework for database repairs. CoRR abs/2306.15516 (2023) - [i25]Yasir Mahmood, Jonni Virtema
Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. CoRR abs/2312.01973 (2023) - 2022
- [j12]Miika Hannula
Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals. Ann. Pure Appl. Log. 173(10): 103108 (2022) - [c28]Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem
Temporal Team Semantics Revisited. LICS 2022: 44:1-44:13 - 2021
- [j11]Flavio Ferrarotti
Descriptive complexity of deterministic polylogarithmic time and space. J. Comput. Syst. Sci. 119: 145-163 (2021) - [c27]Miika Hannula
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. CSL 2021: 27:1-27:22 - [c26]Jonni Virtema
Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity. FSTTCS 2021: 52:1-52:17 - [c25]Miika Hannula
Tractability Frontiers in Probabilistic Team Semantics and Existential Second-Order Logic over the Reals. JELIA 2021: 262-278 - [i24]Yasir Mahmood, Jonni Virtema:
Parameterised Complexity of Propositional Logic in Team Semantics. CoRR abs/2105.14887 (2021) - [i23]Jens Oliver Gutsfeld, Arne Meier, Christoph Ohrem, Jonni Virtema:
Temporal Team Semantics Revisited. CoRR abs/2110.12699 (2021) - 2020
- [j10]Miika Hannula
Polyteam semantics. J. Log. Comput. 30(8): 1541-1566 (2020) - [c24]Miika Hannula
Descriptive complexity of real computation and probabilistic independence logic. LICS 2020: 550-563 - [i22]Miika Hannula
Descriptive complexity of real computation and probabilistic independence logic. CoRR abs/2003.00644 (2020) - [i21]Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. CoRR abs/2007.03867 (2020) - [i20]Jonni Virtema, Jana Hofmann, Bernd Finkbeiner, Juha Kontinen, Fan Yang:
Linear-time Temporal Logic with Team Semantics: Expressivity and Complexity. CoRR abs/2010.03311 (2020) - [i19]Miika Hannula, Jonni Virtema:
Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals. CoRR abs/2012.12830 (2020)
2010 – 2019
- 2019
- [j9]Katsuhiko Sano
Characterising modal definability of team-based logics via the universal modality. Ann. Pure Appl. Log. 170(9): 1100-1127 (2019) - [j8]Lauri Hella
Model checking and validity in propositional and modal inclusion logics. J. Log. Comput. 29(5): 605-630 (2019) - [c23]Miika Hannula
Facets of Distribution Identities in Probabilistic Team Semantics. JELIA 2019: 304-320 - [c22]Dimitri Surinx, Jan Van den Bussche
Fully Generic Queries: Open Problems and Some Partial Answers. MEDI 2019: 20-31 - [c21]Flavio Ferrarotti
Descriptive Complexity of Deterministic Polylogarithmic Time. WoLLIC 2019: 208-222 - [i18]Flavio Ferrarotti, Senén González, José Maria Turull Torres, Jan Van den Bussche, Jonni Virtema:
Descriptive Complexity of Deterministic Polylogarithmic Time. CoRR abs/1903.03413 (2019) - 2018
- [j7]Arnaud Durand, Miika Hannula
Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83(3-4): 297-320 (2018) - [j6]Miika Hannula
Complexity of Propositional Logics in Team Semantic. ACM Trans. Comput. Log. 19(1): 2:1-2:14 (2018) - [c20]Flavio Ferrarotti, Jan Van den Bussche
Expressivity Within Second-Order Transitive-Closure Logic. CSL 2018: 22:1-22:18 - [c19]Arnaud Durand, Miika Hannula
Probabilistic Team Semantics. FoIKS 2018: 186-206 - [c18]Miika Hannula
Polyteam Semantics. LFCS 2018: 190-210 - [c17]Andreas Krebs, Arne Meier
Team Semantics for the Specification and Verification of Hyperproperties. MFCS 2018: 10:1-10:16 - [i17]Arnaud Durand, Miika Hannula, Juha Kontinen, Arne Meier, Jonni Virtema:
Probabilistic team semantics. CoRR abs/1803.02180 (2018) - [i16]Flavio Ferrarotti, Jan Van den Bussche, Jonni Virtema:
Expressivity within second-order transitive-closure logic. CoRR abs/1804.05926 (2018) - [i15]Miika Hannula, Åsa Hirvonen, Juha Kontinen, Vadim Kulikov, Jonni Virtema:
Facets of Distribution Identities in Probabilistic Team Semantics. CoRR abs/1812.05873 (2018) - 2017
- [j5]Jonni Virtema
Complexity of validity for propositional dependence logics. Inf. Comput. 253: 224-236 (2017) - [j4]Johannes Ebbing, Lauri Hella
Boolean dependence logic and partially-ordered connectives. J. Comput. Syst. Sci. 88: 103-125 (2017) - [c16]Lauri Hella
Model Checking and Validity in Propositional and Modal Inclusion Logics. MFCS 2017: 32:1-32:14 - [i14]Miika Hannula
Polyteam Semantics. CoRR abs/1704.02158 (2017) - [i13]Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Team Semantics for the Specification and Verification of Hyperproperties. CoRR abs/1709.08510 (2017) - 2016
- [c15]Arnaud Durand, Miika Hannula
Approximation and Dependence via Multiteam Semantics. FoIKS 2016: 271-291 - [c14]Juha Kontinen
Decidability of Predicate Logics with Team Semantics. MFCS 2016: 60:1-60:14 - [c13]Katsuhiko Sano
Characterizing Relative Frame Definability in Team Semantics via the Universal Modality. WoLLIC 2016: 392-409 - [c12]Miika Hannula
On Quantified Propositional Logics and the Exponential Time Hierarchy. GandALF 2016: 198-212 - [i12]Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema:
Model Checking and Validity in Propositional and Modal Inclusion Logics. CoRR abs/1609.06951 (2016) - 2015
- [j3]Lauri Hella
Weak models of distributed computing, with connections to modal logic. Distributed Comput. 28(1): 31-53 (2015) - [c11]Katsuhiko Sano
Axiomatizing Propositional Dependence Logics. CSL 2015: 292-307 - [c10]Miika Hannula
Complexity of Propositional Independence and Inclusion Logic. MFCS (1) 2015: 269-280 - [c9]Andreas Krebs, Arne Meier
A Team Based Variant of CTL. TIME 2015: 140-149 - [c8]Katsuhiko Sano
Characterizing Frame Definability in Team Semantics via the Universal Modality. WoLLIC 2015: 140-155 - [i11]Katsuhiko Sano, Jonni Virtema:
Characterising Modal Definability of Team-Based Logics via the Universal Modality. CoRR abs/1502.07884 (2015) - [i10]Miika Hannula
Complexity of Propositional Independence and Inclusion Logic. CoRR abs/1504.06135 (2015) - [i9]Andreas Krebs, Arne Meier, Jonni Virtema:
Parallel Computational Tree Logic. CoRR abs/1505.01964 (2015) - [i8]Arnaud Durand, Miika Hannula
Approximation and Dependence via Multiteam Semantics. CoRR abs/1510.09040 (2015) - 2014
- [j2]Juha Kontinen
Complexity of two-variable dependence logic and IF-logic. Inf. Comput. 239: 237-253 (2014) - [c7]Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni Virtema:
The Expressive Power of Modal Dependence Logic. Advances in Modal Logic 2014: 294-312 - [c6]Jonni Virtema
Complexity of validity for propositional dependence logics. GandALF 2014: 18-31 - [i7]Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni Virtema:
The Expressive Power of Modal Dependence Logic. CoRR abs/1406.6266 (2014) - [i6]Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema:
Boolean Dependence Logic and Partially-Ordered Connectives. CoRR abs/1406.7132 (2014) - [i5]Juha Kontinen, Antti Kuusisto, Jonni Virtema:
Decidable Fragments of Logics Based on Team Semantics. CoRR abs/1410.5037 (2014) - [i4]Katsuhiko Sano, Jonni Virtema:
Axiomatizing Propositional Dependence Logics. CoRR abs/1410.5038 (2014) - 2013
- [j1]Antti Kuusisto, Jeremy Meyers, Jonni Virtema
Undecidable First-Order Theories of Affine Geometries. Log. Methods Comput. Sci. 9(4) (2013) - [c5]Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema
Boolean Dependence Logic and Partially-Ordered Connectives. WoLLIC 2013: 111-125 - [c4]Johannes Ebbing, Lauri Hella, Arne Meier
Extended Modal Dependence Logic. WoLLIC 2013: 126-137 - 2012
- [c3]Antti Kuusisto, Jeremy Meyers, Jonni Virtema
Undecidable First-Order Theories of Affine Geometries. CSL 2012: 470-484 - [c2]Lauri Hella
Weak models of distributed computing, with connections to modal logic. PODC 2012: 185-194 - [i3]Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema:
Weak Models of Distributed Computing, with Connections to Modal Logic. CoRR abs/1205.2051 (2012) - [i2]Antti Kuusisto, Jeremy Meyers, Jonni Virtema:
Undecidable First-Order Theories of Affine Geometries. CoRR abs/1208.4930 (2012) - 2011
- [c1]Juha Kontinen
Complexity of Two-Variable Dependence Logic and IF-Logic. LICS 2011: 289-298 - [i1]Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema:
Complexity of two-variable Dependence Logic and IF-Logic. CoRR abs/1104.3148 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 01:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: