Recommendations
Cites work
- A Single Approach to Decide Chase Termination on Linear Existential Rules
- Acyclicity notions for existential rules and their application to query answering in ontologies
- All-instances termination of chase is undecidable
- Anatomy of the Chase
- Data exchange: semantics and query answering
- Efficient model construction for Horn logic with VLog (system description)
- scientific article; zbMATH DE number 1953134 (Why is no real title available?)
- scientific article; zbMATH DE number 7561463 (Why is no real title available?)
- scientific article; zbMATH DE number 7561477 (Why is no real title available?)
- Modal languages and bounded fragments of predicate logic
- On rules with existential variables: walking the decidability line
- Query answering with transitive and linear-ordered data
- Taming the infinite chase: query answering under expressive relational constraints
- Towards more expressive ontology languages: the query answering problem
This page was built for publication: Uniform Restricted Chase Termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156026)