Similar Items: Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
- Buffered Bounded Transparent Scan for Test Generation
- Tighter Bounds for Query Answering with Guarded TGDs
- Refined Risk Bounds for Unbounded Losses via Transductive Priors
- Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
- First Order Logic on Pathwidth Revisited Again
- Honey, I Shrunk the Hypothesis Space (Through Logical Preprocessing)