Fundamental properties of deterministic and nondeterministic extensions of Datalog

DOI10.1016/0304-3975(51)90006-0zbMATH Open0722.68032OpenAlexW2035762642MaRDI QIDQ756410FDOQ756410

Authors: Serge Abiteboul, Eric Simon 

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(51)90006-0

Recommendations

• Datalog extensions for database queries and updates
• Deterministic and non-deterministic stable models
• Datalog with non-deterministic choice computes NDB-PTIME
• Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
• A nondeterministic well-founded semantics

zbMATH Keywords

Datalogquery language

Mathematics Subject Classification ID

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

Cites Work

• Computable queries for relational data bases
• Title not available (Why is that?)
• Title not available (Why is that?)
• Why not negation by fixpoint?
• Title not available (Why is that?)

Cited In (8)

• Temporal connectives versus explicit timestamps to query temporal databases
• Non-determinism in logic-based languages
• Positive Dedalus programs tolerate non-causality
• Title not available (Why is that?)
• Datalog extensions for database queries and updates
• Games and total Datalog\(^{\lnot}\) queries
• A value-propagating transformation technique for Datalog programs based on non-deterministic constructs
• A semantics for a class of non-deterministic and causal production system programs

Uses Software

• Datalog

This page was built for publication: Fundamental properties of deterministic and nondeterministic extensions of Datalog

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