Martin Lück

According to our database, Martin Lück authored at least 17 papers between 2014 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic.

Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020

Team logic: axioms, expressiveness, complexity.

Martin Lück

PhD thesis, 2020

On the complexity of linear temporal logic with team semantics.

Martin Lück

Theor. Comput. Sci., 2020

2019

On the Succinctness of Atoms of Dependency.

Martin Lück, Miikka Vilander

Log. Methods Comput. Sci., 2019

Canonical Models and the Complexity of Modal Team Logic.

Martin Lück

Log. Methods Comput. Sci., 2019

2018

Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic.

Martin Lück

Int. J. Found. Comput. Sci., 2018

Axiomatizations of team logics.

Martin Lück

Ann. Pure Appl. Log., 2018

On the Complexity of Team Logic and Its Two-Variable Fragment.

Martin Lück

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

Parametrised Complexity of Satisfiability in Temporal Logic.

Martin Lück, Arne Meier, Irena Schindler

ACM Trans. Comput. Log., 2017

On the Complexity of Modal Team Logic and Two-Variable Team Logic.

Martin Lück

CoRR, 2017

The Power of the Filtration Technique for Modal Logics with Team Semantics.

Martin Lück

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016

Complete Problems of Propositional Logic for the Exponential Hierarchy.

Martin Lück

CoRR, 2016

On Quantified Propositional Logics and the Exponential Time Hierarchy.

Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema

Proceedings of the Seventh International Symposium on Games, 2016

Axiomatizations for Propositional and Modal Team Logic.

Martin Lück

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015

LTL Fragments are Hard for Standard Parameterisations.

Martin Lück, Arne Meier

Proceedings of the 22nd International Symposium on Temporal Representation and Reasoning, 2015

Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem.

Martin Lück, Arne Meier, Irina Schindler

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies.

Martin Lück, Arne Meier, Irina Schindler

Electron. Colloquium Comput. Complex., 2014