Characterizing Boundedness in Chase Variants

DOI10.1017/S1471068420000083zbMath1472.68188arXiv2004.10030OpenAlexW3018864169MaRDI QIDQ4957209

Marie-Laure Mugnier, Michel Leclère, Stathis Delivorias, Federico Ulliana

Publication date: 3 September 2021

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.10030

zbMATH Keywords

knowledge representationnonmonotonic reasoninglogic programmingdatabasessemantic web reasoning

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data exchange: semantics and query answering
• On rules with existential variables: walking the decidability line
• Boundedness is undecidable for datalog programs with a single recursive rule
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
• Undecidable boundedness problems for datalog programs
• Undecidable optimization problems for database logic programs
• A Proof Procedure for Data Dependencies
• Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs
• About Boundedness for some Datalog and Datalog^neg Programs
• Anatomy of the Chase
• Datalog and Its Extensions for Semantic Web Databases
• All–Instances Termination of Chase is Undecidable
• On the k-Boundedness for Existential Rules

This page was built for publication: Characterizing Boundedness in Chase Variants