Bounded fitting can be extended to expressive description logics while retaining generalization guarantees and implemented practically via SAT solvers.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
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
-
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.