We solve a well known, long-standing open problem in relational databases theory, showing that the conjunctive query determinacy problem (in its "unrestricted" version) is undecidable.
|Title of host publication||Logic in Computer Science (LICS), 2015 30th Annual ACM/IEEE Symposium on|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||281 - 292|
|Number of pages||12|
|Publication status||Published - 2015|