3 citations · 4 across the 6 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2026
Partially Finite Model Reasoning in Description Logics Extended Version
Tomasz Gogacz, Filip Murlak, Marcin Przybyłko +2
Aiming to harmonise finite and infinite model reasoning, we initiate the study of partially finite models, where the reasoning task comes with a formula that specifies a part of th…
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.LO2018
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…