About boundedness for some datalog and DATALOGneg programs
From MaRDI portal
Publication:5096840
DOI10.1007/3-540-55808-X_27zbMath1493.68069MaRDI QIDQ5096840
Marcos Veloso-Peixoto, Irène Guessarian
Publication date: 18 August 2022
Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boundedness is undecidable for datalog programs with a single recursive rule
- Data independent recursion in deductive databases
- Datalog extensions for database queries and updates
- Why not negation by fixpoint?
- Bounds in the propagation of selection into logic programs
- Undecidable optimization problems for database logic programs
- Equivalences Among Relational Expressions with the Union and Difference Operators
- The well-founded semantics for general logic programs