About boundedness for some DATALOG and DATALOG\textsuperscript{neg} programs

DOI10.1007/3-540-55808-X_27MaRDI QIDQ5096840zbMATH OpenFDO

Authors Irène Guessarian, Marcos Veloso-Peixoto

Publication date 18 August 2022

Published in Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55808-X_27

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Knowledge representation (68T30)

Recommendations

• About Boundedness for some Datalog and Datalog^neg Programs
• scientific article; zbMATH DE number 219219
• PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE
• Undecidable boundedness problems for datalog programs
• Static analysis in Datalog extensions

Cites work

• Boundedness is undecidable for datalog programs with a single recursive rule
• Bounds in the propagation of selection into logic programs
• Data independent recursion in deductive databases
• Datalog extensions for database queries and updates
• Equivalences Among Relational Expressions with the Union and Difference Operators
• scientific article; zbMATH DE number 4147465 (Why is no real title available?)
• scientific article; zbMATH DE number 4057061 (Why is no real title available?)
• scientific article; zbMATH DE number 4104920 (Why is no real title available?)
• scientific article; zbMATH DE number 219219 (Why is no real title available?)
• The well-founded semantics for general logic programs
• Undecidable optimization problems for database logic programs
• Why not negation by fixpoint?

Cited in

(7)

• Deciding the bisimilarity relation between Datalog goals
• Undecidable optimization problems for database logic programs
• Static analysis in Datalog extensions
• About Boundedness for some Datalog and Datalog^neg Programs
• 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?)
• Datalog queries distributing over components

This page was built for publication: About boundedness for some DATALOG and DATALOG\textsuperscript{neg} programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096840)