cq_minimization (533B)
1 # CQ minimization 2 3 The *CQ minimization* problem is the [query_minimization] problem on [CQs] 4 5 Can be done by a [greedy_algorithm], as explained in [morvan2025homomorphism] p17 among other places: iteratively remove [variables] while the resulting [query] (on an [induced_substructure]) is still [query_equivalent] 6 7 The result is unique up to [isomorphism]: it is called the [core] of Q. It also minimizes the number of [atoms], the [pathwidth], and the [treewidth] 8 9 Up: [query_minimization] 10 11 Aliases: minimization_conjunctive_query