{"paper":{"title":"Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Grzegorz G{\\l}uch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja","submitted_at":"2018-02-05T18:33:16Z","abstract_excerpt":"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 information contained in the views $\\mathcal{Q}({\\mathbb D})$ is sufficient to compute $Q_0({\\mathbb D})$. Query Determinacy Problem is the problem of deciding, for given $\\mathcal{Q}$ and $Q_0$, whether $\\mathcal{Q}$ determines $Q_0$. Many versions of this problem, for different query languages, were studied in database theory. In this paper we s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01554","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}