Showing cs.LOShow all
2 papers · 1 filter
cs.LO2024
On Homomorphism Indistinguishability and Hypertree Depth
Benjamin Scheidt
is a logic introduced by Scheidt and Schweikardt (2023) to express properties of hypergraphs. It is similar to first-order logic with counting quantifiers () adapted to t…
cs.LO2023
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation
Benjamin Scheidt, Nicole Schweikardt
We introduce the 2-sorted counting logic that expresses properties of hypergraphs. This logic has available k variables to address hyperedges, an unbounded number of variabl…