Bounded Fitting for Expressive Description Logics
arXiv:2605.07452v1 Announce Type: new
Abstract: Bounded fitting is an attractive paradigm for learning logical formulas from labeled data examples that offers PAC-style generalization guarantees and can often be implemented leveraging SAT solvers. It …