Zobrazeno 1 - 10
of 241
pro vyhledávání: '"Marcinkowski, Jerzy"'
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 two natural notions of conservative extension, one pertaining to answer
Externí odkaz:
http://arxiv.org/abs/2202.05689
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 bags (multisets) of tuples rather than as sets of tuples. But disappointi
Externí odkaz:
http://arxiv.org/abs/2112.12742
Autor:
Kirsten, Daniel, Marcinkowski, Jerzy
This paper deals with decision problems related to the star problem in trace monoids, which means to determine whether the iteration of a recognizable trace language is recognizable. Due to a theorem by G. Richomme from 1994 [32, 33], we know that th
Autor:
Tworek, Karolina, Tomaszewska, Agata, Owecka, Barbara, Fryska, Zuzanna, Marcinkowski, Jerzy T., Owecki, Maciej
Publikováno v:
In Journal of Stroke and Cerebrovascular Diseases January 2024 33(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 a theory is core-terminating (FES) and admits query rewriting (BDD, F
Externí odkaz:
http://arxiv.org/abs/2012.11269
Autor:
Kirsten, Daniel, Marcinkowski, Jerzy
This paper deals with decision problems related to the star problem in trace monoids, which means to determine whether the iteration of a recognizable trace language is recognizable. Due to a theorem by G. Richomme from 1994 [32, 33], we know that th
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: for a given set of tuple-generating dependencies (TGDs), is it the cas
Externí odkaz:
http://arxiv.org/abs/1901.03897
In our paper [G{\l}uch, Marcinkowski, Ostropolski-Nalewaja, LICS ACM, 2018] we have solved an old problem stated in [Calvanese, De Giacomo, Lenzerini, Vardi, SPDS ACM, 2000] showing that query determinacy is undecidable for Regular Path Queries. Here
Externí odkaz:
http://arxiv.org/abs/1808.07767
For a given set of queries (which are expressions in some query language) $\mathcal{Q}=\{Q_1$, $Q_2, \ldots Q_k\}$ and for another query $Q_0$ we say that $\mathcal{Q}$ determines $Q_0$ if -- informally speaking -- for every database $\mathbb D$, the
Externí odkaz:
http://arxiv.org/abs/1802.01554
Autor:
Gogacz, Tomasz, Marcinkowski, Jerzy
We solve a well known and long-standing open problem in database theory, proving that Conjunctive Query Finite Determinacy Problem is undecidable. The technique we use builds on the top of our Red Spider method which we developed in our paper [GM15]
Externí odkaz:
http://arxiv.org/abs/1512.01681