4 citations · 8 across the 9 of their papers we have counts for
4 papers · 1 filter
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
Isolde Adler, Eva Fluck, Tim Seppelt +1
We study the expressive power of first-order logic with counting quantifiers, especially the -variable and quantifier-rank- fragment, using homomorphism indistinguishability.…
An Algorithmic Meta Theorem for Homomorphism Indistinguishability
Tim Seppelt
Two graphs and are homomorphism indistinguishable over a family of graphs if for all graphs the number of homomorphisms from to is…
Limitations of Game Comonads via Homomorphism Indistinguishability
Moritz Lichter, Benedikt Pago, Tim Seppelt
Abramsky, Dawar, and Wang (2017) introduced the pebbling comonad for k-variable counting logic and thereby initiated a line of work that imports category theoretic machinery to fin…
Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth
Eva Fluck, Tim Seppelt, Gian Luca Spitzer
We study the expressive power of first-order logic with counting quantifiers, especially the -variable and quantifier-rank- fragment , using homomorphism indi…