Semantics and expressive power of nondeterministic constructs in deductive databases
From MaRDI portal
Recommendations
Cites work
- ``Possible is certain is desirable and can be expressive
- Datalog with non-deterministic choice computes NDB-PTIME
- Fixed-point extensions of first-order logic
- Horn clause queries and generalizations
- scientific article; zbMATH DE number 4180775 (Why is no real title available?)
- scientific article; zbMATH DE number 3874667 (Why is no real title available?)
- scientific article; zbMATH DE number 1368934 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Languages that Capture Complexity Classes
- Non-determinism in logic-based languages
- Procedural languages for database queries and updates
- Programming with non-determinism in deductive databases
- Reasoning about termination of pure Prolog programs
- Relational queries computable in polynomial time
- Structure and complexity of relational queries
- The expressive power of stratified logic programs
Cited in
(11)- Minimalism, justification and non-monotonicity in deductive databases
- Non-determinism in databases
- Programming with non-determinism in deductive databases
- Deductive databases for computing certain and consistent answers from mediated data integration systems
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- Datalog with non-deterministic choice computes NDB-PTIME
- Fixed-point Logics with Nondeterministic Choice
- Expressiveness of efficient semi-deterministic choice constructs
- scientific article; zbMATH DE number 1931656 (Why is no real title available?)
- The Choice Construct in the Soufflé Language
- Semantics and properties of existential quantifiers in deductive databases
This page was built for publication: Semantics and expressive power of nondeterministic constructs in deductive databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5943120)
