4 papers
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…
Let's Play Tag: Linear Time Evaluation of Conjunctive Queries under TGD Constraints
Nofar Carmeli, Carsten Lutz, Marcin PrzybyÅko
We study the limits of linear time evaluation of conjunctive queries under constraints expressed as tuple-generating dependencies (TGDs), across several modes of query evaluation:…
Computing measures of weak-MSO definable sets of trees
Damian NiwiÅski, Marcin PrzybyÅko, MichaÅ Skrzypczak
This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recogni…
Spectra of Cardinality Queries over Description Logic Knowledge Bases
Quentin Manière, Marcin PrzybyÅko
Recent works have explored the use of counting queries coupled with Description Logic ontologies. The answer to such a query in a model of a knowledge base is either an integer or…