23 April 2024: We are investigating problems with ecommerce on Cambridge Core. We apologise for any inconvenience and hope to have full functionality restored shortly.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
${\cal F}{{\cal L}_0}$wer ReasonerPublished online by Cambridge University Press: 15 October 2021
The inexpressive Description Logic (DL)
${\cal F}{{\cal L}_0}$
, which has conjunction and value restriction as its only concept constructors, had fallen into disrepute when it turned out that reasoning in
${\cal F}{{\cal L}_0}$
w.r.t. general TBoxes is ExpTime-complete, that is, as hard as in the considerably more expressive logic 
${\cal A}{\cal L}{\cal C}$
. In this paper, we rehabilitate
${\cal F}{{\cal L}_0}$
by presenting a dedicated subsumption algorithm for
${\cal F}{{\cal L}_0}$
, which is much simpler than the tableau-based algorithms employed by highly optimized DL reasoners. Our experiments show that the performance of our novel algorithm, as prototypically implemented in our
${\cal F}{{\cal L}_0}$
wer reasoner, compares very well with that of the highly optimized reasoners.
${\cal F}{{\cal L}_0}$
wer can also deal with ontologies written in the extension 
${\cal F}{{\cal L}_ \bot }$
of
${\cal F}{{\cal L}_0}$
with the top and the bottom concept by employing a polynomial-time reduction, shown in this paper, which eliminates top and bottom. We also investigate the complexity of reasoning in DLs related to the Horn-fragments of
${\cal F}{{\cal L}_0}$
and
${\cal F}{{\cal L}_ \bot }$
.
This paper is under consideration in Theory and Practice of Logic Programming (TPLP).
${\cal E}{\cal L}$
envelope. In Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), Kaelbling, L. P. and Saffiotti, A., Eds. Edinburgh, UK. Morgan Kaufmann, Los Altos, 364–369.Google Scholar
${\cal F}{{\cal L}_0}$
with respect to general TBoxes. In LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Barthe, G., Sutcliffe, G. and Veanes, M., Eds. vol. 57 of EPiC Series in Computing. EasyChair, 76–94.Google Scholar
${\cal F}{{\cal L}_0}$
using tree automata. In GCAI-2018, 4th Global Conference on Artificial Intelligence, Lee, D. D., Steen, A. and Walsh, T., Eds. vol. 55 of EPiC Series in Computing. EasyChair, 1–14.Google Scholar
${\cal F}{{\cal L}_0}$
. In Logics in Artificial Intelligence - 15th European Conference, JELIA 2016, Proceedings, Michael, L. and Kakas, A. C., Eds. vol. 10021 of Lecture Notes in Computer Science, 49–63.Google Scholar
${\cal F}{{\cal L}_0}$
. In Companion of the The Web Conference WWW, Champin, P., Gandon, F. L., Lalmas, M. and Ipeirotis, P. G., Eds. ACM, 1603–1607.Google Scholar
${\cal S}{\cal H}{\cal I}{\cal Q}$
ontologies. In Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (IJCAI 2009), C. Boutilier, Ed. IJCAI/AAAI, 2040–2045.Google Scholar
${\cal F}{{\cal L}_0}$
for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. In Proc. of the 2003 Description Logic Workshop (DL 2003). CEUR Electronic Workshop Proceedings, http://CEUR-WS.org/Vol-81/.Google Scholar
${\cal F}{{\cal L}_0}$
wer reasoner. In Proceedings of the 3rd International Joint Conference on Rules and Reasoning (RuleML+RR 2019), Fodor, P. and Montali, M., Eds. LNCS, Bolzano, Italy. Springer.Google Scholar
You have
Access
Open access
