4 citations · 8 across the 6 of their papers we have counts for
9 papers
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…
ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
Anselm Haak, Patrick Koopmann, Yasir Mahmood +1
Given a knowledge base (KB) with a non-entailed fact, the ABox abduction problem asks for possible extensions of the KB that would entail this fact. This problem has many applicati…
Why not? Developing ABox Abduction beyond Repairs
Anselm Haak, Patrick Koopmann, Yasir Mahmood +1
Abduction is the task of computing a sufficient extension of a knowledge base (KB) that entails a conclusion not entailed by the original KB. It serves to compute explanations, or…
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…
Counting of Teams in First-Order Team Logics
Anselm Haak, Juha Kontinen, Fabian Müller +2
We study descriptive complexity of counting complexity classes in the range from #P to #NP. A corollary of Fagin's characterization of NP by existential second-order logic i…