Boundedness is undecidable for datalog programs with a single recursive rule
From MaRDI portal
Publication:1123647
DOI10.1016/0020-0190(89)90019-7zbMath0677.68103OpenAlexW1983914494WikidataQ51221214 ScholiaQ51221214MaRDI QIDQ1123647
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90019-7
Undecidability and degrees of sets of sentences (03D35) Information storage and retrieval of data (68P20)
Related Items (5)
On the decidability of the termination problem of active database systems ⋮ A semantic approach to optimize linear datalog programs ⋮ About boundedness for some datalog and DATALOGneg programs ⋮ On the complexity of single-rule datalog queries. ⋮ Characterizing Boundedness in Chase Variants
Uses Software
Cites Work
This page was built for publication: Boundedness is undecidable for datalog programs with a single recursive rule