Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation

Benjamin Scheidt, Nicole Schweikardt

We introduce the 2-sorted counting logic $G{C}^k$ that expresses properties of hypergraphs. This logic has available k variables to address hyperedges, an unbounded number of variabl…