Martin Lück

26 papers B 5C 2Journal 17Unranked 1
YearRankTypeTitle / Venue / Authors
2021 B conf
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic.
CSL
Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema
2020 J jnl
On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic.
CoRR
Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema
2020 J jnl
On the Complexity of Linear Temporal Logic with Team Semantics.
CoRR
Martin Lück
2020 J jnl
On the complexity of linear temporal logic with team semantics.
Theor. Comput. Sci.
Martin Lück
2020 — —
Team logic: axioms, expressiveness, complexity.
Martin Lück
2019 J jnl
Canonical Models and the Complexity of Modal Team Logic.
Log. Methods Comput. Sci.
Martin Lück
2019 J jnl
On the Succinctness of Atoms of Dependency.
CoRR
Martin Lück, Miikka Vilander
2019 J jnl
On the Succinctness of Atoms of Dependency.
Log. Methods Comput. Sci.
Martin Lück, Miikka Vilander
2018 J jnl
Axiomatizations of team logics.
Ann. Pure Appl. Log.
Martin Lück
2018 B conf
Canonical Models and the Complexity of Modal Team Logic.
CSL
Martin Lück
2018 B conf
On the Complexity of Team Logic and Its Two-Variable Fragment.
MFCS
Martin Lück
2018 J jnl
On the Complexity of Team Logic and its Two-Variable Fragment.
CoRR
Martin Lück
2018 J jnl
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic.
Int. J. Found. Comput. Sci.
Martin Lück
2017 J jnl
On the Complexity of Modal Team Logic and Two-Variable Team Logic.
CoRR
Martin Lück
2017 J jnl
Parametrised Complexity of Satisfiability in Temporal Logic.
ACM Trans. Comput. Log.
Martin Lück, Arne Meier, Irena Schindler
2017 B conf
The Power of the Filtration Technique for Modal Logics with Team Semantics.
CSL
Martin Lück
2016 B conf
Axiomatizations for Propositional and Modal Team Logic.
CSL
Martin Lück
2016 J jnl
Axiomatizations of Team Logics.
CoRR
Martin Lück
2016 J jnl
Complete Problems of Propositional Logic for the Exponential Hierarchy.
CoRR
Martin Lück
2016 — conf
On Quantified Propositional Logics and the Exponential Time Hierarchy.
GandALF
Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema
2015 C conf
LTL Fragments are Hard for Standard Parameterisations.
TIME
Martin Lück, Arne Meier
2015 J jnl
LTL Fragments are Hard for Standard Parameterisations.
CoRR
Martin Lück, Arne Meier
2015 C conf
Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem.
LATA
Martin Lück, Arne Meier, Irina Schindler
2015 J jnl
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic.
CoRR
Martin Lück
2014 J jnl
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem.
CoRR
Martin Lück, Arne Meier, Irina Schindler
2014 J jnl
Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies.
Electron. Colloquium Comput. Complex.
Martin Lück, Arne Meier, Irina Schindler