Datalog with non-deterministic choice computes NDB-PTIME

DOI10.1016/S0743-1066(97)10004-8MaRDI QIDQ4208855zbMATH OpenFDO

Authors F. Giannotti, Dino Pedreschi

Publication date 4 October 1998

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0743-1066(97)10004-8

zbMATH Keywords

logic database languages

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• Datalog extensions for database queries and updates
• Semantics and expressive power of nondeterministic constructs in deductive databases
• Fundamental properties of deterministic and nondeterministic extensions of Datalog
• Nondeterminism through well-founded choice

Cited in

(6)

• Semantics and expressive power of nondeterministic constructs in deductive databases
• Datalog extensions for database queries and updates
• Minimal-change integrity maintenance using tuple deletions
• Fundamental properties of deterministic and nondeterministic extensions of Datalog
• Extending stratified datalog to capture complexity classes ranging from \(\mathcal P\) to \(Cal Q\mathcal H\)
• Scalar aggregation in inconsistent databases.

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Datalog with non-deterministic choice computes NDB-PTIME

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