177 citations · 621 across the 42 of their papers we have counts for
Showing 2018 · cs.LOShow all
2 papers · 2 filters
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,…