activity
20062023
most citedConjunctive Query Answering for the Description Logic SHIQ

177 citations · 621 across the 42 of their papers we have counts for

collaborators
Showing cs.LOShow all

14 papers · 1 filter

cs.LO2022★ 1 cited

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…

cs.LO2021★ 1 cited

Separating Data Examples by Description Logic Concepts with Restricted Signatures

Jean Christoph Jung, Carsten Lutz, Hadrien Pulcini +1

We study the separation of positive and negative data examples in terms of description logic concepts in the presence of an ontology. In contrast to previous work, we add a signatu…

cs.LO2020★ 8 cited

Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

Pierre Bourhis, Carsten Lutz

We study query containment in three closely related formalisms: monadic disjunctive Datalog (MDDLog), MMSNP (a logical generalization of constraint satisfaction problems), and onto…

cs.LO2020★ 1 cited

Logical Separability of Labeled Data Examples under Ontologies

Jean Christoph Jung, Carsten Lutz, Hadrien Pulcini +1

Finding a logical formula that separates positive and negative examples given in the form of labeled data items is fundamental in applications such as concept learning, reverse eng…

cs.LO2018★ 14 cited

The Data Complexity of Ontology-Mediated Queries with Closed Predicates

Carsten Lutz, Inanc Seylan, Frank Wolter

In the context of ontology-mediated querying with description logics (DLs), we study the data complexity of queries in which selected predicates can be closed (OMQCs). We provide a…

cs.LO2018

Weighted model counting beyond two-variable logic

Antti Kuusisto, Carsten Lutz

It was recently shown by van den Broeck at al. that the symmetric weighted first-order model counting problem (WFOMC) for sentences of two-variable logic FO2 is in polynomial time,…