commit 395d1de88fea5b6fc7fb6f3adcddae80463eea0f
parent 650d48930c5d2cd4566a2fd1f8eff4178299ec5f
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Tue, 31 Mar 2026 11:44:21 +0200
commit with codex
Diffstat:
4 files changed, 15 insertions(+), 5 deletions(-)
diff --git a/access_pattern b/access_pattern
@@ -2,9 +2,9 @@
[academic_papers]:
-- [kara2022conjunctive] [incremental_maintenance]
+- [kara2022conjunctive] and [kara2025conjunctive]: [incremental_maintenance]
- [zhao2023space]: [complexity_space] vs [complexity_time] tradeoff
Up: [database_theory]
-Aliases: access patterns
+Aliases: access patterns, access method, access methods
diff --git a/description_logics b/description_logics
@@ -5,7 +5,10 @@ A set of lightweight [logics] with different complexity depending on the feature
[Survey_paper]: [artale2009dllite]
Classes:
-- [DL-Lite]
+- [DL_Lite]
+ - [DL_Lite_F]
+ - [DL_Lite_FR]
+ - [DL_Lite_FR]
- [ALC]
- conjunctions imply disjunctions
- can use existentials in [rule_head] and [rule_body]
diff --git a/hyperclique_hypothesis b/hyperclique_hypothesis
@@ -6,8 +6,8 @@ For any k >= 3, detecting a k-[hyperclique] in a (k-1)-[uniform_hypergraph] cann
- implies in particular [triangle_detection_conjecture]: you cannot detect triangles in O(n^2) in graphs
-Up: [hypergraph]
+Up: [hypergraph], [complexity_hypothesis]
-Aliases: hyperclique conjecture
+Aliases: hyperclique conjecture, hyperclique assumption
See also: [clique_problem]
diff --git a/tuple_generating_dependency_full b/tuple_generating_dependency_full
@@ -0,0 +1,7 @@
+# Full TGD
+
+A [TGD] with no [existential_quantifiers]
+
+Up: [tuple_generating_dependency]
+
+Aliases: Full TGD, Full TGDs, full tuple generating dependency, full tuple generating dependencies, TGD full
