Equivalence of Datalog queries is undecidable
From MaRDI portal
Publication:4036288
DOI10.1016/0743-1066(93)90040-NzbMATH Open0825.68352MaRDI QIDQ4036288FDOQ4036288
Publication date: 16 May 1993
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Cited In (14)
- A theoretical framework for knowledge-based entity resolution
- Decidable containment of recursive queries
- The delay and window size problems in rule-based stream reasoning
- Speeding up inferences using relevance reasoning: a formalism and algorithms
- Verification of knowledge bases based on containment checking
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views
- Query containment for data integration systems
- Datalog Queries Distributing over Components
- Logical foundations of information disclosure in ontology-based data integration
- Answering regular path queries in expressive description logics via alternating tree-automata
- Guarded Ontology-Mediated Queries
- Containment of conjunctive queries on annotated relations
- Relaxed notions of schema mapping equivalence revisited
- Containment of Monadic Datalog Programs via Bounded Clique-Width
Uses Software
This page was built for publication: Equivalence of Datalog queries is undecidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036288)
