Semi-oblivious chase termination: the sticky case

DOI10.1007/s00224-020-09994-5zbMath1477.68088OpenAlexW3055759583MaRDI QIDQ2035470

Marco Calautti, Andreas Pieris

Publication date: 24 June 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-020-09994-5

zbMATH Keywords

computational complexityterminationstickinesschase proceduretuple-generating dependencies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Related Items (2)

Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation ⋮ Query answering over inconsistent knowledge bases: a probabilistic approach

Uses Software

• RDFox

Cites Work

• Towards more expressive ontology languages: the query answering problem
• Data exchange: semantics and query answering
• On rules with existential variables: walking the decidability line
• Efficient model construction for Horn logic with VLog (system description)
• Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
• A Proof Procedure for Data Dependencies
• Anatomy of the Chase
• A Single Approach to Decide Chase Termination on Linear Existential Rules
• All–Instances Termination of Chase is Undecidable
• Fast Query Answering over Existential Rules
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semi-oblivious chase termination: the sticky case