Semantics and expressive power of nondeterministic constructs in deductive databases (Q5943120): Difference between revisions

@@ Property / DOI @@
-.1006/jcss.1999.1699
@@ Property / DOI: 10.1006/jcss.1999.1699 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/jcss.1999.1699
+Normal rank
@@ Property / OpenAlex ID @@
+W1995532290
@@ Property / OpenAlex ID: W1995532290 / rank @@
+Normal rank
@@ Property / cites work @@
+Procedural languages for database queries and updates
+Normal rank
@@ Property / cites work @@
+Q3204028
@@ Property / cites work: Q3204028 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-determinism in logic-based languages
@@ Property / cites work: Non-determinism in logic-based languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4864249
@@ Property / cites work: Q4864249 / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about termination of pure Prolog programs
+Normal rank
@@ Property / cites work @@
+Structure and complexity of relational queries
@@ Property / cites work: Structure and complexity of relational queries / rank @@
+Normal rank
@@ Property / cites work @@
+Horn clause queries and generalizations
@@ Property / cites work: Horn clause queries and generalizations / rank @@
+Normal rank
@@ Property / cites work @@
+Datalog with non-deterministic choice computes NDB-PTIME
+Normal rank
@@ Property / cites work @@
+Q3340205
@@ Property / cites work: Q3340205 / rank @@
+Normal rank
@@ Property / cites work @@
+Programming with non-determinism in deductive databases
+Normal rank
@@ Property / cites work @@
+``Possible is certain'' is desirable and can be expressive
+Normal rank
@@ Property / cites work @@
+Fixed-point extensions of first-order logic
@@ Property / cites work: Fixed-point extensions of first-order logic / rank @@
+Normal rank
@@ Property / cites work @@
+Relational queries computable in polynomial time
@@ Property / cites work: Relational queries computable in polynomial time / rank @@
+Normal rank
@@ Property / cites work @@
+Languages that Capture Complexity Classes
@@ Property / cites work: Languages that Capture Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+The expressive power of stratified logic programs
@@ Property / cites work: The expressive power of stratified logic programs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4702578
@@ Property / cites work: Q4702578 / rank @@
+Normal rank
@@ Property / DOI @@
+.1006/JCSS.1999.1699
@@ Property / DOI: 10.1006/JCSS.1999.1699 / rank @@
+Normal rank