20 citations · 59 across the 14 of their papers we have counts for
16 papers
Conservative Extensions for Existential Rules
Jean Christoph Jung, Carsten Lutz, Jerzy Marcinkowski
We study the problem to decide, given sets T1,T2 of tuple-generating dependencies (TGDs), also called existential rules, whether T2 is a conservative extension of T1. We consider t…
Determinacy of Real Conjunctive Queries. The Boolean Case
Jarosław Kwiecień, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
In their classical 1993 paper [CV93] Chaudhuri and Vardi notice that some fundamental database theory results and techniques fail to survive when we try to see query answers as bag…
A Journey to the Frontiers of Query Rewritability
Piotr Ostropolski-Nalewaja, Jerzy Marcinkowski, David Carral +1
This paper is about (first order) query rewritability in the context of theory-mediated query answering. The starting point of our journey is the FUS/FES conjecture, saying that if…
All-Instances Restricted Chase Termination
Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris
The chase procedure is a fundamental algorithmic tool in database theory with a variety of applications. A key problem concerning the chase procedure is all-instances termination:…
The First Order Truth behind Undecidability of Regular Path Queries Determinacy
Grzegorz Głuch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
In our paper [Głuch, Marcinkowski, Ostropolski-Nalewaja, LICS ACM, 2018] we have solved an old problem stated in [Calvanese, De Giacomo, Lenzerini, Vardi, SPDS ACM, 2000] showing t…
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable
Grzegorz Głuch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
For a given set of queries (which are expressions in some query language) , and for another query we say that determines…