Uniform Restricted Chase Termination

DOI10.1137/20m1377035zbMath1527.68053OpenAlexW4377712667MaRDI QIDQ6156026

Tomasz Gogacz, Andreas Pieris, Jerzy Marcinkowski

Publication date: 9 June 2023

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/20m1377035

zbMATH Keywords

decidabilityBüchi automatastickinessguardednesstuple-generating dependenciesmonadic second-order logicyrestricted chaseuniform chase termination

Mathematics Subject Classification ID

Database theory (68P15) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Modal languages and bounded fragments of predicate logic
• 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
• Anatomy of the Chase
• Query Answering with Transitive and Linear-Ordered Data
• A Single Approach to Decide Chase Termination on Linear Existential Rules
• All–Instances Termination of Chase is Undecidable

This page was built for publication: Uniform Restricted Chase Termination