Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Locality and subsumption testing in EL and some of its extensions


Sofronie-Stokkermans,  Viorica
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Sofronie-Stokkermans, V. (2008). Locality and subsumption testing in EL and some of its extensions. In F. Baader, C. Lutz, & B. Motik (Eds.), Proceedings of the 21st International Workshop on Description Logics (DL-2008) (pp. Art.31.1-11). Aachen: CEUR.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1C1D-F
In this paper we show that subsumption problems in many lightweight description logics (including ${\cal EL}$) can be expressed as uniform word problems in classes of semilattices with monotone operators. We use possibilities of efficient local reasoning in such classes of algebras to obtain uniform PTIME decision procedures for CBox subsumption in ${\cal EL}$ and extensions thereof. These locality considerations allow us to present a new family of logics which extend ${\cal EL}$ and also a new extension of ${\cal EL}^+$.