cgFOC admits computable VC-dimension bounds on nowhere dense structures and efficient algorithms for query answering and PAC learning on locally bounded expansion classes, but a minor extension is intractable on trees.
Enumeration for FO queries over nowhere dense graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces a rank measure for FO logic and proves a rank-preserving Gaifman normal form, yielding a simplified proof for almost-linear time decision of FO properties on nowhere-dense structures.
citing papers explorer
-
Complexity of Clique-Guarded First-Order Logic with Counting
cgFOC admits computable VC-dimension bounds on nowhere dense structures and efficient algorithms for query answering and PAC learning on locally bounded expansion classes, but a minor extension is intractable on trees.
-
A Rank-Preserving Gaifman Normal Form
Introduces a rank measure for FO logic and proves a rank-preserving Gaifman normal form, yielding a simplified proof for almost-linear time decision of FO properties on nowhere-dense structures.