commit 0cdbad911c4ee78f42e231340f168a929a234715
parent d7e7102aff63f16d48f724306da516db8357f187
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Tue, 7 Apr 2026 21:55:31 +0200
Merge remote-tracking branch 'origin/master'
Diffstat:
9 files changed, 33 insertions(+), 10 deletions(-)
diff --git a/conjunctive_query_diversity b/conjunctive_query_diversity
@@ -6,4 +6,4 @@
Up: [diversity] of [conjunctive_query]
-See also: [conjunctive_query_representativity]
+See also: [conjunctive_query_representativity], [sampling_query_answers]
diff --git a/conjunctive_query_representativity b/conjunctive_query_representativity
@@ -4,4 +4,4 @@
Up: [representativity] of [conjunctive_query]
-See also: [conjunctive_query_diversity]
+See also: [conjunctive_query_diversity], [sampling_query_answers]
diff --git a/constant_free_query b/constant_free_query
@@ -0,0 +1,11 @@
+# Constant-free query
+
+A [query] which does not feature [query_constants]
+
+There are [constant_removal_techniques], e.g., coding them to a [unary_predicate]
+
+Up: [query]
+
+Aliases: Constant-free query, constant free queries, constant-free queries
+
+See also: [unique_name_assumption]
diff --git a/enumeration_diversity b/enumeration_diversity
@@ -1,6 +1,6 @@
# Enumeration diversity
-- [merkl2023diversity]
+- [merkl2023diversity] / [merkl2025diversity]
Up: [diversity], [enumeration]
diff --git a/probabilistic_circuit b/probabilistic_circuit
@@ -9,7 +9,7 @@
optional conditions:
- [smooth]
- [determinism]: disjoint support on the inputs (= non-zero proba mass?)
-- [structured]
+- [structuredness]
we want to do [maximum_a_posteriori] on such circuits
- [marginal_maximum_a_posteriori], MMAP
@@ -28,3 +28,5 @@ connections to other kinds of [polynomials] than [probability_distributions]: se
See also: [arithmetic_circuit], [circuit_algebraic]
Up: [circuit], [probabilities]
+
+Aliases: probabilistic circuits
diff --git a/query b/query
@@ -7,6 +7,7 @@
- [non_Boolean_query]
- [query_with_negation]
- [database_returning_queries]
+- [query_constants] / [constant_free_query]
## Problems
diff --git a/structure b/structure
@@ -13,6 +13,6 @@ Operations:
Up: [logic]
-See also: [relational_instance]
+See also: [relational_instance], [structuredness]
Aliases: structure (logic)
diff --git a/topological_order b/topological_order
@@ -0,0 +1,9 @@
+# Topological order
+
+A [total_order] on the [vertices] of a [DAG] such that whenever u has a path to v then u comes before v in the order
+
+- [topological_sorting]
+
+Up: [order], [DAG]
+
+Aliases: topological ordering, topological orderings
diff --git a/topological_sorting b/topological_sorting
@@ -1,14 +1,14 @@
# Topological sorting
-Problem on [directed_graphs]: find a [total_order] on the graph vertices such that whenever u has a path to v then u comes before v in the order
-- only possible, as stated, when the graph is a [DAG]
-
https://en.wikipedia.org/wiki/Topological_sorting
+[Computational_problem] on [directed_graphs] of finding a [topological_order]
+- only possible, as stated, when the graph is a [DAG]
+
- [constrained_topological_sorting]
Up: [graph_algorithm], [directed_acyclic_graph]
-See also: [strongly_connected_component_algorithm], [linear_extension]
+See also: [strongly_connected_component_algorithm], [linear_extension], [topological_order], [topology], [Topological_minor]
-Aliases: topological sort, topological ordering, topological orderings
+Aliases: topological sort
