Pages that link to "Item:Q3128622"
From MaRDI portal
The following pages link to Undecidable boundedness problems for datalog programs (Q3128622):
Displaying 4 items.
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Stack size analysis for interrupt-driven programs (Q703848) (← links)
- On the decidability of the termination problem of active database systems (Q1884939) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
