The First Order Truth behind Undecidability of Regular Path Queries Determinacy
Grzegorz G{\l}uch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
TL;DR
This paper proves that query determinacy remains undecidable even for finite unions of conjunctive path queries, extending previous results that only applied to regular path queries.
Contribution
It generalizes the undecidability of query determinacy to broader classes of queries beyond regular path queries.
Findings
Undecidability of query determinacy for regular path queries.
Undecidability extends to finite unions of conjunctive path queries.
No regularity constraint is needed for undecidability.
Abstract
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 a strong generalisation of this result is shown, and -- we think -- a very unexpected one. We prove that no regularity is needed: determinacy remains undecidable even for finite unions of conjunctive path queries.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.