A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Locality and Applications to Subsumption Testing in EL and Some of its Extensions
2013
Scientific Annals of Computer Science
In this paper we show that subsumption problems in the description logics EL and 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 TBox and CBox subsumption in EL and EL + . These locality considerations allow us to present a new family of (possibly many-sorted) logics which extend EL and EL + with n-ary roles and/or numerical domains.
doi:10.7561/sacs.2013.2.251
fatcat:iu7yjagcpfb4bkevvuh4kikbhu