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.
First-Order Query Evaluation with Cardi- nality Conditions
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Bounded fitting can be extended to expressive description logics while retaining generalization guarantees and implemented practically via SAT solvers.
Develops an exact convergent variant of the frog-based Fréchet distance algorithm with open-source code and experiments showing Bringmann et al. often faster in practice.
citing papers explorer
-
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.
-
Bounded Fitting for Expressive Description Logics
Bounded fitting can be extended to expressive description logics while retaining generalization guarantees and implemented practically via SAT solvers.
-
On computing the (exact) Fr\'echet distance with a frog
Develops an exact convergent variant of the frog-based Fréchet distance algorithm with open-source code and experiments showing Bringmann et al. often faster in practice.