Preserving Constraints with the Stable Chase

DOI10.4230/LIPIcs.ICDT.2018.12zbMath1489.68073OpenAlexW2793400933MaRDI QIDQ3305357

Markus Krötzsch, Maximilian Marx, David Carral, Sebastian Rudolph, Ana Ozaki

Publication date: 6 August 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.ICDT.2018.12

zbMATH Keywords

universal modeltuple-generating dependenciesBCQ entailmentincidental constraintsinfinite core chase

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (1)

Unnamed Item

Uses Software

• Ontop

Cites Work

• Unnamed Item
• Towards more expressive ontology languages: the query answering problem
• Data exchange: semantics and query answering
• On rules with existential variables: walking the decidability line
• The core of a graph
• Cores and compactness of infinite directed graphs
• Preservation of integrity constraints in definite DATALOG programs
• On the complexity of single-rule datalog queries.
• Core-like properties of infinite graphs and structures
• Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
• Data exchange: getting to the core
• A Proof Procedure for Data Dependencies
• STACS 2005

This page was built for publication: Preserving Constraints with the Stable Chase