Representation Theorems and Locality for Subsumption Testing and Interpolation in the Description Logics ɛℒ, ɛℒ+ and their Extensions with n-ary Roles and Numerical Domains
Viorica Sofronie-Stokkermans · Fundamenta Informaticae · 2017
In this paper we show that subsumption problems in lightweight description logics (such as ɛℒ and ɛℒ+) 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 ɛℒ, ɛℒ+ and extensions thereof. These locality considerations allow us to present a new family of (possibly many-sorted) logics which extend ɛℒ and ɛℒ+ with n-ary roles and/or numerical domains. As a by-product, this allows us to show that the algebraic models of ɛℒ and ɛℒ+ have ground interpolation and thus that ɛℒ, ɛℒ+, and their extensions studied in this paper have interpolation.