Undecidable boundedness problems for datalog programs
From MaRDI portal
Publication:3128622
DOI10.1016/0743-1066(95)00051-KzbMath0876.68021OpenAlexW2009098458MaRDI QIDQ3128622
Moshe Y. Vardi, Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson
Publication date: 17 April 1997
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(95)00051-k
Related Items (12)
On the decidability of the termination problem of active database systems ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Nonrecursive incremental evaluation of Datalog queries ⋮ Eliminating Recursion from Monadic Datalog Programs on Trees ⋮ On the k-Boundedness for Existential Rules ⋮ On the complexity of single-rule datalog queries. ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ Unnamed Item ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ Stack size analysis for interrupt-driven programs ⋮ Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation ⋮ Characterizing Boundedness in Chase Variants
Uses Software
This page was built for publication: Undecidable boundedness problems for datalog programs
