Bounded fitting can be extended to expressive description logics while retaining generalization guarantees and implemented practically via SAT solvers.
Proc.\ of KR , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
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.