Boundedness is undecidable for datalog programs with a single recursive rule
From MaRDI portal
(Redirected from Publication:1123647)
Recommendations
- Undecidable boundedness problems for datalog programs
- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs
- About Boundedness for some Datalog and Datalogneg Programs
- Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs
- PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE
Cites work
Cited in
(9)- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs
- scientific article; zbMATH DE number 219219 (Why is no real title available?)
- A semantic approach to optimize linear datalog programs
- Undecidable optimization problems for database logic programs
- On the decidability of the termination problem of active database systems
- On the complexity of single-rule datalog queries.
- About boundedness for some DATALOG and DATALOG\textsuperscript{neg} programs
- Characterizing boundedness in chase variants
- PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE
This page was built for publication: Boundedness is undecidable for datalog programs with a single recursive rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123647)