On the decidability of the termination problem of active database systems (Q1884939): Difference between revisions

@@ Property / cites work @@
+Boundedness is undecidable for datalog programs with a single recursive rule
+Normal rank
@@ Property / cites work @@
+Q4864249
@@ Property / cites work: Q4864249 / rank @@
+Normal rank
@@ Property / cites work @@
+Procedural languages for database queries and updates
+Normal rank
@@ Property / cites work @@
+Computing with first-order logic
@@ Property / cites work: Computing with first-order logic / rank @@
+Normal rank
@@ Property / cites work @@
+QRT FIFO automata, breadth-first grammars and their relations
+Normal rank
@@ Property / cites work @@
+Undecidable optimization problems for database logic programs
+Normal rank
@@ Property / cites work @@
+Undecidable boundedness problems for datalog programs
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4251540
@@ Property / cites work: Q4251540 / rank @@
+Normal rank
@@ Property / cites work @@
+Semantics and expressiveness issues in active databases
+Normal rank