3 citations · 4 across the 2 of their papers we have counts for
4 papers
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…
Efficiently Enumerating Answers to Ontology-Mediated Queries
Carsten Lutz, Marcin Przybyłko
We study the enumeration of answers to ontology-mediated queries (OMQs) where the ontology is a set of guarded TGDs or formulated in the description logic ELI and the query is a co…
The Uniform Measure of Simple Regular Sets of Infinite Trees
Marcin Przybyłko, Michał Skrzypczak
We consider the problem of computing the measure of a regular set of infinite binary trees. While the general case remains unsolved, we show that the measure of a language can be c…
On Computing the Measures of First-Order Definable Sets of Trees
Marcin Przybyłko
We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language def…