Non-determinism in logic-based languages
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4180775 (Why is no real title available?)
- scientific article; zbMATH DE number 4035805 (Why is no real title available?)
- scientific article; zbMATH DE number 4064544 (Why is no real title available?)
- scientific article; zbMATH DE number 3300566 (Why is no real title available?)
- A transaction-based approach to relational database specification
- Computable queries for relational data bases
- Datalog extensions for database queries and updates
- Fundamental properties of deterministic and nondeterministic extensions of Datalog
- Incomplete Information in Relational Databases
- Languages that Capture Complexity Classes
- Procedural languages for database queries and updates
- Relational queries computable in polynomial time
- Structure and complexity of relational queries
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- The expressive power of stratified logic programs
Cited in
(7)- An extension of fixpoint logic with a symmetry-based choice construct
- Semantics and expressive power of nondeterministic constructs in deductive databases
- Epsilon-logic is more expressive than first-order logic over finite structures
- Expressiveness of efficient semi-deterministic choice constructs
- Restricted ideals and the groupability property. Tools for temporal reasoning.
- Semantics and proof theory of the epsilon calculus
- scientific article; zbMATH DE number 7566070 (Why is no real title available?)
This page was built for publication: Non-determinism in logic-based languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360676)
