About boundedness for some datalog and DATALOGneg programs (Q5096840): Difference between revisions

@@ Property / cites work @@
+Q3477931
@@ Property / cites work: Q3477931 / rank @@
+Normal rank
@@ Property / cites work @@
+Boundedness is undecidable for datalog programs with a single recursive rule
+Normal rank
@@ Property / cites work @@
+Datalog extensions for database queries and updates
+Normal rank
@@ Property / cites work @@
+Bounds in the propagation of selection into logic programs
+Normal rank
@@ Property / cites work @@
+Undecidable optimization problems for database logic programs
+Normal rank
@@ Property / cites work @@
+Q4694701
@@ Property / cites work: Q4694701 / rank @@
+Normal rank
@@ Property / cites work @@
+Why not negation by fixpoint?
@@ Property / cites work: Why not negation by fixpoint? / rank @@
+Normal rank
@@ Property / cites work @@
+Q3829532
@@ Property / cites work: Q3829532 / rank @@
+Normal rank
@@ Property / cites work @@
+Data independent recursion in deductive databases
@@ Property / cites work: Data independent recursion in deductive databases / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalences Among Relational Expressions with the Union and Difference Operators
+Normal rank
@@ Property / cites work @@
+Q3792280
@@ Property / cites work: Q3792280 / rank @@
+Normal rank
@@ Property / cites work @@
+The well-founded semantics for general logic programs
+Normal rank