no code implementations • 12 Jul 2021 • Anneke Haga, Carsten Lutz, Leif Sabellek, Frank Wolter
(Almost) all of them reduce the data complexity from coNP-complete to PTime, in some cases even to fixed-parameter tractable and to linear time.
no code implementations • 21 Jan 2020 • Anneke Haga, Carsten Lutz, Johannes Marti, Frank Wolter
We study complete approximations of an ontology formulated in a non-Horn description logic (DL) such as $\mathcal{ALC}$ in a Horn DL such as~$\mathcal{EL}$.
