18 citations · 20 across the 3 of their papers we have counts for
5 papers
A Van Benthem Theorem for Modal Team Semantics
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor +1
The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an ex…
Modal Independence Logic
Juha Kontinen, Julian-Steffen Müller, Henning Schnoor +1
This paper introduces modal independence logic MIL, a modal logic that can explicitly talk about independence among propositional variables. Formulas of MIL are not evaluated in wo…
Parameterized Enumeration with Ordering
Nadia Creignou, Raïda Ktari, Arne Meier +3
The classes Delay-FPT and Total-FPT recently have been introduced into parameterized complexity in order to capture the notion of efficiently solvable parameterized enumeration pro…
Paradigms for Parameterized Enumeration
Nadia Creignou, Arne Meier, Julian-Steffen Müller +2
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of para…
A Fragment of Dependence Logic Capturing Polynomial Time
Johannes Ebbing, Juha Kontinen, Julian-Steffen Müller +1
In this paper we study the expressive power of Horn-formulae in dependence logic and show that they can express NP-complete problems. Therefore we define an even smaller fragment D…