The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
From MaRDI portal
Publication:4635811
DOI10.1109/LICS.2015.35zbMath1401.68062arXiv1501.01817OpenAlexW1894718966MaRDI QIDQ4635811
Jerzy Marcinkowski, Tomasz Gogacz
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.01817
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Undecidability and degrees of sets of sentences (03D35)
Related Items (4)
On Monotonic Determinacy and Rewritability for Recursive Queries and Views ⋮ Asymptotic determinacy of path queries using union-of-paths views ⋮ SOME MODEL THEORY OF GUARDED NEGATION ⋮ Unnamed Item
This page was built for publication: The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable