Q5028455 (Q5028455): Difference between revisions

@@ Property / cites work @@
+Provenance Circuits for Trees and Treelike Instances
+Normal rank
@@ Property / cites work @@
+Q4864249
@@ Property / cites work: Q4864249 / rank @@
+Normal rank
@@ Property / cites work @@
+Ontology-Based Data Access
@@ Property / cites work: Ontology-Based Data Access / rank @@
+Normal rank
@@ Property / cites work @@
+Open-world probabilistic databases: semantics, algorithms, complexity
+Normal rank
@@ Property / cites work @@
+Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+On Datalog vs. LFP
@@ Property / cites work: On Datalog vs. LFP / rank @@
+Normal rank
@@ Property / cites work @@
+The dichotomy of probabilistic inference for unions of conjunctive queries
+Normal rank
@@ Property / cites work @@
+Dichotomies for Queries with Negation in Probabilistic Databases
+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 @@
+YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+Probabilistic Databases
@@ Property / cites work: Probabilistic Databases / rank @@
+Normal rank