12 citations · 23 across the 4 of their papers we have counts for
5 papers · 1 filter
On the Succinctness of Atoms of Dependency
Martin Lück, Miikka Vilander
Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed…
Canonical Models and the Complexity of Modal Team Logic
Martin Lück
We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion l…
On Quantified Propositional Logics and the Exponential Time Hierarchy
Miika Hannula, Juha Kontinen, Martin Lück +1
We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize…
Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic
Martin Lück
The satisfiability problem of the branching time logic CTL is studied in terms of computational complexity. Tight upper and lower bounds are provided for each temporal operator fra…
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem
Martin Lück, Arne Meier, Irina Schindler
We present an almost complete classification of the parameterized complexity of all operator fragments of the satisfiability problem in computation tree logic CTL. The investigated…