9 papers · 1 filter
A Parameterized View on the Complexity of Dependence Logic
Juha Kontinen, Arne Meier, Yasir Mahmood
In this paper, we investigate the parameterized complexity of model checking for Dependence Logic which is a well studied logic in the area of Team Semantics. We start with a list…
Enumerating Teams in First-Order Team Logics
Anselm Haak, Arne Meier, Fabian Müller +1
We start the study of the enumeration complexity of different satisfiability problems in first-order team logics. Since many of our problems go beyond DelP, we use a framework for…
Parameterised Counting in Logspace
Anselm Haak, Arne Meier, Om Prakash +1
In this paper, we introduce a new framework for parameterised counting in logspace, inspired by the parameterised space bounded models developed by Elberfeld, Stockhusen and Tantau…
Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic
Yasir Mahmood, Arne Meier
In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of Väänänen from 2007.…
Enumeration in Incremental FPT-Time
Arne Meier
In this paper, we study the relationship of parametrised enumeration complexity classes defined by Creignou et al. (MFCS 2013). Specifically, we introduce two hierarchies (IncFPTa…
Probabilistic team semantics
Arnaud Durand, Miika Hannula, Juha Kontinen +2
Team semantics is a semantical framework for the study of dependence and independence concepts ubiquitous in many areas such as databases and statistics. In recent works team seman…