Pages that link to "Item:Q3128622"
From MaRDI portal
The following pages link to Undecidable boundedness problems for datalog programs (Q3128622):
Displaying 16 items.
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Bounded nondeterminism of logic programs (Q702093) (← links)
- Stack size analysis for interrupt-driven programs (Q703848) (← links)
- A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters (Q1378382) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- On the decidability of the termination problem of active database systems (Q1884939) (← links)
- Nonrecursive incremental evaluation of Datalog queries (Q1924723) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Eliminating Recursion from Monadic Datalog Programs on Trees (Q2946356) (← links)
- On Bounded Database Schemes and Bounded Horn-Clause Programs (Q3777438) (← links)
- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs (Q4593950) (← links)
- Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation (Q4957206) (← links)
- Characterizing Boundedness in Chase Variants (Q4957209) (← links)
- (Q5028455) (← links)
- On the k-Boundedness for Existential Rules (Q6104757) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
