scientific article; zbMATH DE number 7561477

DOI10.4230/LIPIcs.ICDT.2019.17MaRDI QIDQ5091130

Andreas Pieris, Marco Calautti

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexityterminationstickinesschase proceduretuple-generating dependencies

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Uniform Restricted Chase Termination ⋮ Semi-oblivious chase termination: the sticky case

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
• Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
• Incomplete Data and Data Dependencies in Relational Databases
• A Proof Procedure for Data Dependencies
• Anatomy of the Chase
• All–Instances Termination of Chase is Undecidable

This page was built for publication: