Abstract
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.
Original language | English |
---|---|
Title of host publication | Logic in Computer Science (LICS), 2015 30th Annual ACM/IEEE Symposium on |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 281 - 292 |
Number of pages | 12 |
ISBN (Print) | 978-1-4799-8875-4 |
DOIs | |
Publication status | Published - 2015 |