Boundedness is undecidable for datalog programs with a single recursive rule

DOI10.1016/0020-0190(89)90019-7zbMath0677.68103OpenAlexW1983914494WikidataQ51221214 ScholiaQ51221214MaRDI QIDQ1123647

Serge Abiteboul

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

zbMATH Keywords

datalogboundednessdata processingdatabasesdeductive databases

Mathematics Subject Classification ID

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

• Datalog

Cites Work

• On the foundations of the universal relation model
• Unnamed Item

This page was built for publication: Boundedness is undecidable for datalog programs with a single recursive rule