Locality and Subsumption Testing in EL and Some of its Extensions

Abstract. We show that subsumption problems in EL and related description logics 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 EL and extensions thereof. These locality considerations allow us to present a new family of logics which extend EL and EL+ with n-ary roles and/or numerical domains.

• Type: Conference
• Year: 2008
• Where: DLOG
• Authors: Viorica Sofronie-Stokkermans
• Keywords: Automated Reasoning, CBox Subsumption, DLOG 2008, Subsumption Problems, Uniform Word Problems