activity
20192026
most citedParametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic

1 citations · 1 across the 9 of their papers we have counts for

collaborators
Showing cs.LOShow all

5 papers · 1 filter

cs.LO2026

The More the Merrier: Combining Properties for ABox Abduction under Repair Semantics in ELbot

Anselm Haak, Patrick Koopmann, Yasir Mahmood +1

Abduction is a central approach to explain missing entailments from a knowledge base by providing a hypothesis, that would, if added to the knowledge base, make the missing entailm…

cs.LO2023

Logics with probabilistic team semantics and the Boolean negation

Miika Hannula, Minna Hirvonen, Juha Kontinen +3

We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic ind…

cs.LO2023

Parameterized Complexity of Weighted Team Definability

Juha Kontinen, Yasir Mahmood, Arne Meier +1

In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analogue of one of the most studied problems in par…

cs.LO2021

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…

cs.LO2019★ 1 cited

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.…