Equivalence of Datalog queries is undecidable

DOI10.1016/0743-1066(93)90040-NMaRDI QIDQ4036288zbMATH OpenFDO

Authors Oded Shmueli

Publication date 16 May 1993

Published in The Journal of Logic Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

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
• Containment of monadic Datalog programs via bounded clique-width
• Logical foundations of information disclosure in ontology-based data integration
• Answering regular path queries in expressive description logics via alternating tree-automata
• Containment of conjunctive queries on annotated relations
• Guarded Ontology-Mediated Queries
• Relaxed notions of schema mapping equivalence revisited
• Datalog queries distributing over components

Describes a project that uses

Uses Software

• Datalog

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)