177 citations · 621 across the 42 of their papers we have counts for
45 papers
Querying Circumscribed Description Logic Knowledge Bases
Carsten Lutz, Quentin Manière, Robin Nolte
Circumscription is one of the main approaches for defining non-monotonic description logics (DLs). While the decidability and complexity of traditional reasoning tasks such as sati…
Description Logics with Abstraction and Refinement
Carsten Lutz, Lukas Schulze
Ontologies often require knowledge representation on multiple levels of abstraction, but description logics (DLs) are not well-equipped for supporting this. We propose an extension…
SAT-Based PAC Learning of Description Logic Concepts
Balder ten Cate, Maurice Funk, Jean Christoph Jung +1
We propose bounded fitting as a scheme for learning description logic concepts in the presence of ontologies. A main advantage is that the resulting learning algorithms come with t…
Efficient Answer Enumeration in Description Logics with Functional Roles -- Extended Version
Carsten Lutz, Marcin Przybylko
We study the enumeration of answers to ontology-mediated queries when the ontology is formulated in a description logic that supports functional roles and the query is a CQ. In par…
On the non-efficient PAC learnability of conjunctive queries
Balder ten Cate, Maurice Funk, Jean Christoph Jung +1
This note serves three purposes: (i) we provide a self-contained exposition of the fact that conjunctive queries are not efficiently learnable in the Probably-Approximately-Correct…
Extremal Fitting Problems for Conjunctive Queries
Balder ten Cate, Victor Dalmau, Maurice Funk +1
The fitting problem for conjunctive queries (CQs) is the problem to construct a CQ that fits a given set of labeled data examples. When a fitting CQ exists, it is in general not un…