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